AQA 7517 4.3.4.1: Linear search
The free BugBot lesson that teach this point, a robot to try it on, and the past-paper questions that test it.
What it covers
At GCSE (F5.5 and F5.6) you learned what linear and binary search do and that binary search needs sorted data. At A level you also need to trace them precisely, write them in pseudocode, write binary search recursively, and analyse their time and space complexity.
- Linear search
- Binary search
- Binary search by recursion
- Is sorting first worth it?
Or do it in the simulator, with tasks that mark themselves
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.1 and is not endorsed by the board.