B2.4 Programming algorithms

This section focuses on core programming algorithms and their analysis, equipping students with the tools to evaluate and implement efficient solutions. Students will describe algorithm efficiency using Big O notation to assess scalability and performance. They will construct and trace search algorithms (linear and binary) and sorting algorithms (bubble and selection), evaluating their time and space complexities. Higher-level students will explore the concept of recursion, learning to identify recursive patterns and construct recursive algorithms to solve problems that benefit from self-referential logic.