Jump Search
Jumps ahead in fixed-size blocks on a sorted array, then performs a linear scan within the block.
Interactive Visualization
Loading visualization…
Usage
import { jumpSearch } from 'athro';
const arr = [1, 2, 5, 6, 8, 12, 18, 24];
const index = jumpSearch(arr, 18);
Time Complexity
| Case | Time Complexity | Description |
|---|---|---|
| Best | O(1) | Target at first block |
| Average | O(√n) | Block jump + linear scan |
| Worst | O(√n) | Target in last block |