Linear scans to logarithmic jumps — see exactly how each search narrows the field.
6 visualizations
Scans elements one by one until the target is found or the array ends — works on any array.
Repeatedly halves a sorted array, comparing the middle element to the target — O(log n) lookups.
Jumps ahead in fixed √n blocks on a sorted array, then scans the block that must contain the target.
Predicts the target's index by linear interpolation on value — near O(log log n) on uniformly distributed data.
Doubles a range bound until it passes the target, then binary-searches that range — great for unbounded lists.
Divides a sorted range into three parts with two midpoints, discarding two-thirds each step.