Two free sample worksheets on searching algorithms for AQA A Level Computer
Science (7517), with full answer keys, so you can see exactly what the full
pack contains before buying anything.

Each sheet runs linear search, binary search and binary tree search on the
same values, looking for the same target, so the three counts can be compared
directly. The midpoint rule is printed on the sheet - (Bottom + Top) DIV 2,
rounded down - so the trace has exactly one correct answer.

The last question asks for the time complexity of all three algorithms and for
the largest number of comparisons a binary search could need on a list of
several thousand items: the specification asks students to trace AND to
analyse, and both are on the sheet.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, every one built on a
different list. Search ����Vlog for “AQA A Level Computer Science searching
algorithms” to find it.

If these are useful, a review is genuinely appreciated - it is the only way
other teachers find resources like this.