Jump Search is an algorithm for sorted arrays that jumps ahead by fixed steps (typically √n) to find the block containing the target, then performs a linear search within that block. It balances the efficiency of binary search with simplicity.
Fewer comparisons than linear search
Balances jump size and linear search cost
Requires uniform step size
Simpler compared to binary search
Best suited for medium-sized datasets, requires to be Sorted