Year 10 - Computing
Binary search
Searching and sorting algorithms
Study Hub
Study Guides
This pupil-friendly study guide includes a unit summary, clear notes, common mistakes, and quick questions with answers.
Unit Summary
In this unit pupils will have opportunities to analyse, interpret, modify, and implement a range of searching and sorting algorithms. They will have the opportunity to compare the features and efficiency of these algorithms and make suggestions about the most suitable algorithm for a given task.
Lesson Summary
You will learn to identify when a binary search can be used and perform its steps on a set of data.
Key Notes
- Binary search is an algorithm which can be used to search for an item in a sorted data set.
- It discards half of the remaining data with each comparison and repeats the process until the item is found.
- On average, a binary search can locate an item in a list in less time than a linear search.
- If the data you have is unordered, you must either use a linear search algorithm or sort the data first.
Vocabulary To Learn
- binary search: an algorithm to search for an item in a sorted data set — it discards half of the remaining data with each comparison and repeats the process until the item is found or until the data set is exhausted
- ordered list: a list of items where the values are in either ascending or descending order
Common Mistakes To Avoid
- A binary search can be performed on any data.
3 Quick Questions (With Answers)
1. Describe the system or process from this lesson in clear steps.
Binary search is an algorithm which can be used to search for an item in a sorted data set. It discards half of the remaining data with each comparison and repeats the process until the item is found.
2. Define this computing term and give one practical example. 'binary search'
an algorithm to search for an item in a sorted data set — it discards half of the remaining data with each comparison and repeats the process until the item is found or until the data set is exhausted. Add one real device or system example to prove understanding.
3. Correct this common computing misconception.
Mistake: A binary search can be performed on any data. Correction: A binary search can only be performed on an ordered list as it finds the expected position of the search term based on a selected mid-point in the data.
More Lessons In This Unit
Browse all guides in the Year 10 Computing guide library.