Search Algorithms

Search Algorithms

Compare linear, binary, and jump search step by step on the same array.

How to use

• Type a target value (0–99) and press Linear, Binary or Jump. The orange bar is the element being compared; dimmed bars are outside the part of the array still under consideration.
• Binary and jump search first sort the array, because they only work on sorted data.
• New Array draws 16 random values; Speed changes the animation delay. The markers below the bars show L / M / R for binary search and the current block for jump search.

Linear Search

Checks values one by one. It does not require a sorted array and runs in O(n) time in the worst case.

Binary Search

Requires sorted data and repeatedly halves the remaining search interval, giving O(log n) worst-case time.

Jump Search

Requires sorted data. It jumps by about √n positions, then performs a short linear scan, giving O(√n) worst-case time.