SHSubjectHub

Searching Algorithms

AQA 75174.3.4A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 11 questions
  • 40 marks
  • about 55 minutes
  • marked instantly

Question types: multiple choice, short answer, fill the gap, matching, true or false.

Try it with a class, freeHow it works

About this resource

AQA A-level Computer Science (7517) Paper 1, 4.3.4 Searching algorithms — know and be able to trace and analyse the time complexity of linear search (O(n)), binary search (O(log n)), and binary tree search (O(log n) for a balanced binary search tree).

30 slides.

Lesson outline

  1. Do Now — Retrieval
  2. I-Do: What Is Linear Search?
  3. Hinge Check — Does Linear Search Need Sorted Data?
  4. I-Do: Tracing Linear Search on an Unsorted List
  5. We-Do — Trace Linear Search on a New List
  6. I-Do: Linear Search Complexity — O(n) — and What Big-O Means
  7. Linear Search — Step Through It
  8. Quick Check — Big-O Growth for Linear Search
  9. Hinge Check — Big-O Growth: What Happens When n Doubles?
  10. I-Do: What Is Binary Search?
  11. Binary Search — Step Through It
  12. I-Do: Tracing Binary Search on a Sorted List
Unit bundlePaper 1
Part of: Paper 1: the whole unitEvery resource in the unit in one zip.

More from 4.3 Fundamentals of algorithms