A single-topic, no-prep secondary worksheet on binary search for KS4 / GCSE Computer Science revision, cover lessons and homework. Covers what binary search is, why the list must be sorted, tracing binary search, worst-case comparisons, and why it is O(log n) compared with O(n) linear search. Includes a student worksheet and a separate answer key. Mapped to AQA GCSE Computer Science 8525, 3.1 Fundamentals of algorithms — Searching algorithms and Efficiency of algorithms.
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.
£1.00