Computer Science · Theme B: Computational thinking and problem-solving

B2.4 — Programming algorithms

Computer Science · SL / HL · syllabus-mapped notes

1. CS_B2.4.1

   Big O notation and efficiency

   Time and space complexity, calculating Big O, and choosing by scalability.

2. CS_B2.4.2

   Linear search and binary search

   Constructing, tracing and comparing the two search algorithms.

3. CS_B2.4.3

   Bubble sort and selection sort

   Constructing, tracing and evaluating the time and space complexities of each sort.

4. CS_B2.4.4

   The concept of recursion (HL)

   Fundamentals, advantages and limitations, with applications including quicksort.

5. CS_B2.4.5

   Constructing recursive algorithms (HL)

   Constructing and tracing simple, non-branching recursive algorithms.