B2.4 Algorithms student handout
The main class handout: Big O notation, linear and binary search, bubble sort and selection sort, with explanations and numbered problems.
DP Computer Science · HL Python
Handouts
Find the class handout, open it to read, or download a copy to keep.
Looking for an explanation? Open Lessons. For animations, Python and revision, use Practice & resources. Check CS home for assigned homework.
B2.4 · Programming algorithms
Unit overview →Binary search practice
A separate handout for practising binary search. Use it alongside the lesson and animation.
B2.4 reading & review
Textbook reading, worked examples and review questions with answers, including HL recursion. Try each question before checking the answer.
B2.2 · Lists, stacks & queues
Unit overview →Stacks & queues student handout
Revisit stacks and queues: how items are added and removed, and when to use each structure.