AQA 7517 4.3.4.2: Binary search
The free BugBot lesson that teach this point, a robot to try it on, and the past-paper questions that test it.
Lessons that teach it
- A5.3 Linear and binary search Algorithms and complexity
Tracing both searches in pseudocode, recursive binary search, O(n) against O(log n), and when sorting first pays off.
Try it on a robot
The task from A5.3 Linear and binary search, running here. Change the program and press Run.
The specification is AQA's own document; this page says which of our lessons teach point 4.3.4.2 and is not endorsed by the board.