| Feature | Binary Search | Linear Search |
|---|---|---|
| Method | Check the middle item, discard half, repeat | Check each item one by one from the start |
| List must be sorted? | Yes | No |
| Speed on a large list | Much faster, because half the items go each step | Slower, because it may check every item |
| Best used when | The list is large, sorted and searched often | The list is short or unsorted |
This study notes covers Binary Search or Linear Search? within Binary Search for GCSE Computer Science. Revise Binary Search in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 10 flashcards. This is a high-frequency topic, so it is worth revising until the explanation feels precise and repeatable. It is section 2 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
Practice questions for Binary Search
Which of the following is a requirement before binary search can be used?
Describe how a binary search algorithm finds a target value in a sorted list.
Quick recall flashcards
What is the time complexity of binary search?
O(log n) - logarithmic time
What technique does binary search use?
Divide and conquer - repeatedly halves the search space