Searching Algorithms
OCR J2772.1dGCSELesson 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.
- 8 questions
- 25 marks
- about 20 minutes
- marked instantly
Question types: short answer, multiple choice, matching, multi-part, fill the gap.
Try one from this worksheet
What is a pre-requisite of the binary search algorithm?
Pick an answer: it's marked straight away, just as your pupils would see it.
About this resource
Understand and compare linear search and binary search algorithms, including their prerequisites, steps, pseudocode and efficiency.
13 slides.
Lesson outline
- What Is a Searching Algorithm?
- Linear Search
- Linear Search Check
- Binary Search
- Binary Search - Worked Example
- Search Algorithms Visualiser
- Task 1 - Binary Search Walkthrough
- Comparing Linear and Binary Search
- Which Search?
- Task 2 - Apply Both Algorithms
- Task 3 - Exam-Style Questions
- Lesson Summary
Unit bundle2.1 Algorithms
More from 2.1 Algorithms
- Lesson pack · 2.1aComputational ThinkingFree
- Lesson pack · 2.1bDesigning Algorithms: Flowcharts & PseudocodeSubscription
- Lesson pack · 2.1cTrace Tables & Identifying ErrorsSubscription
- Lesson pack · 2.1eSorting AlgorithmsSubscription
- Knowledge organiser · 2.1AlgorithmsSubscription
- Scheme of work · 2.1AlgorithmsSubscription


