
40 exam-style questions on linear and binary search, with a live streak and timer — built to drill the O(n) vs O(log n) distinction that trips students up on Paper 2.
Full description:
Linear and binary search look simple until an exam question asks students to justify why binary search is faster, or to trace through a search on a specific list — and that’s exactly where marks get lost. This exam-style game covers both algorithms in depth, including their step-by-step mechanics and their efficiency, with a streak-and-timer format that pushes students to answer quickly and confidently rather than second-guessing.
• 40 auto-marked exam-style questions covering linear search and binary search
• Tests both algorithm mechanics (how each search works, step by step) and efficiency (O(n) vs O(log n) reasoning)
• Live streak and timer mechanic keeps pace high and rewards consistent accuracy, not just single correct answers
• Instant feedback with a full explanation for every question
• Runs as a single HTML file: no login, no install, works on any school device
Use it as timed retrieval practice before a Paper 2 mock, a starter to sharpen recall at speed, or independent revision homework on algorithm efficiency.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.