binary search

Sorted list lookup

Binary search is an algorithm for finding an item in a sorted list by repeatedly dividing the search space in half.

You check the middle element; if it's not the target, you eliminate the half where the target can't exist and repeat.

This halving makes binary search dramatically faster than checking every element: A binary search through a million items takes at most twenty comparisons.

algorithm

divide and conquer

Overcome by fragmenting opposition

recursive · iterative · comparison · partition · base case · pseudocode · bisection · pivot · elimination · convergence

data-structure

ordered list

Numbered series of items

lower bound · upper bound · range · subarray · sequence · position · key · lookup · retrieval · contiguous

complexity

worst case

Most unfavorable possibility

performance · scalability · depth

Categories
Opposites
search strategy

binary searchrandom search

Unsystematic examination of possibilities

traversal methodology

binary searchbreadth-first search

Layer-by-layer graph exploration

Family

search, searching, searched, binary, searches, searcher, searchers, binaries

Familiarity
Top 500,000
Profile
Used worldwide · Timeless · Abstract · Rated G