Skip to main content

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​

CaseTime ComplexityDescription
BestO(1)Target at first block
AverageO(√n)Block jump + linear scan
WorstO(√n)Target in last block