DP Computer Science

Lessons

Choose your topic. Each lesson brings together the explanation, class activities, handout and animations.

B2.4 · Programming algorithms

B2.4 · Searching · Review
Linear search
Find the first matching value by checking items in order. Revisit the lesson and practise the stopping condition.
Open lesson →Open handout (PDF)
B2.4 · Algorithm efficiency · Review
Big O notation
Review Big O notation with the class handout and textbook pages 358–361. Compare how time and auxiliary space grow with input size.
Open lesson →Open handout (PDF)
B2.4 · Searching · Review
Binary search
Use sorted data to rule out half of the remaining candidates at each step.
Open lesson →Open handout (PDF)
B2.4 · Sorting · Current focus
Bubble sort & selection sort
Follow how each pass moves values towards their final positions, then implement and compare two sorts.
Open lesson →Open handout (PDF)
B2.4.4–5 · HL · Lesson plan
Recursion and its applications
Follow recursive calls down to a base case and back again, then explore how the same idea supports larger applications.
Open lesson →