Binary search
Find a value in a sorted row by checking the middle and keeping only the half that can hold it. Each look halves the row, so a million items take about twenty looks.
- See also: Search
- See also: Sort
- Used in: Sorting & Searching
Find a value in a sorted row by checking the middle and keeping only the half that can hold it. Each look halves the row, so a million items take about twenty looks.