Sequential scan through every element until the target is found. Works on any array — sorted or unsorted — and finds all occurrences in one pass.

Repeatedly halves the search space by comparing the target with the midpoint element. The gold standard for searching sorted arrays.

Jumps ahead in steps of √n to find the right block, then scans linearly within that block. A practical middle-ground between linear and binary.

Estimates the target's position using value proportions — like looking up a name in a phone book. Excels on uniformly distributed data.

Doubles the bound (1 → 2 → 4 → 8 …) to find a range where the target lies, then applies binary search within that range.

Divides the array using Fibonacci numbers. Avoids division entirely — uses only addition and subtraction to compute probe positions.

Splits the range into three equal thirds using two midpoints, eliminating one third per iteration. An interesting theoretical variant of binary search.

Scans block endpoints in steps of √n to identify the correct block, then searches linearly within it. Also known as Jump Search.