Jump Search Visualizer: Step-by-Step Animation & Complexity

Jump Search

Category: Searching | Time: O(√n) | Space: O(1)

Input Data

Visualization

Visual representation of the data structure

Enter an algorithm and input to start visualization.

About Jump Search

A searching algorithm for sorted arrays. The basic idea is to check fewer elements than linear search by jumping ahead by fixed steps and then doing a linear search in the identified block.

Code Editor

The code is for reference. Editing it won't affect the visualization.

function jumpSearch(arr, x) {
    let n = arr.length;
    let step = Math.floor(Math.sqrt(n));
    let prev = 0;
    while (arr[Math.min(step, n) - 1] < x) {
        prev = step;
        step += Math.floor(Math.sqrt(n));
        if (prev >= n)
            return -1;
    }
    while (arr[prev] < x) {
        prev++;
        if (prev == Math.min(step, n))
            return -1;
    }
    if (arr[prev] == x)
        return prev;
    return -1;
}

Frequently Asked Questions

About Jump Search

What is Jump Search?

How does Jump Search work?

What is the optimal jump size?

What is the time complexity of Jump Search?

When is Jump Search better than Binary Search?

Does Jump Search require a sorted array?

What is the space complexity of Jump Search?

How does it compare to Linear Search?

Can Jump Search be used for linked lists?

What happens if the element is not found?

Where can I learn more?