Search Algorithms
Compare linear, binary, and jump search step by step on the same array.
Ready.
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.