Searching & Sorting Algorithms Bundle: 5 KS3 Lessons | Linear, Binary, Bubble, Insertion, Merge

Five complete, ready-to-teach lessons for Years 7 to 9 covering the key searching and sorting algorithms. Every lesson has step-through slides that show the algorithm one move at a time, a lesson plan, a self-marking drill that works offline, and a printable worksheet with answers.

1. Linear search: checks, best case and worst case
2. Binary search: midpoints, halving, and why the list must be sorted
3. Bubble sort: passes, comparisons, swaps and stopping early
4. Insertion sort: building a sorted list one item at a time
5. Merge sort: divide and conquer, and merging sorted lists

Every lesson ends with Python predict-the-output and spot-the-bug questions, so it links straight to programming. It works as a half-term unit. The school licence covers every teacher.