Mind map
Binary Search
Map content
Binary Search
Very Efficient
- Only works on sorted data
repeat steps until target is found in data set
- Compare item to target. If target matches, stop. If target is smaller than item, get rid off bigger half of data set. If target is bigger than item, get rid of smaller half of data set.
- Find the middle item in the data set
- Compare item to target. If target matches, stop. If target is smaller than item, get rid off bigger half of data set. If target is bigger than item, get rid of smaller half of data set.
Information
- Description
- GCSE Computing Mind Map on Binary Search, created by Sophie Lincoln on 02/05/2019.
- Created by
- Sophie Lincoln · May 2019
- Updated
- May 2, 2019
- Views
- 1
- Rating