Jump Search Simplified: Efficient Searching in Sorted Arrays

Jump Search is a streamlined search technique for large, sorted arrays, offering quick and efficient performance.

In the algorithmic landscape, where efficiency and speed are paramount, Jump Search stands out as a powerful technique designed specifically for ordered lists. It's an intermediary algorithm between the simplistic Linear Search and the more sophisticated Binary Search, offering a balanced approach that combines jumping ahead by fixed steps with a backtracking linear search. This technique is especially useful in large datasets where reducing the number of comparisons can significantly improve performance.

Detailed Algorithm with Pseudo Code and Explanation

Overview of Jump Search:
Jump Search improves upon linear search by dividing the list into smaller segments and then making fixed jumps ahead in the array. If the target is less than the element at the jump point, the algorithm jumps back to the previous segment and performs a linear search. This approach allows it to skip several elements, thereby speeding up the search process in arrays where direct access to elements is possible.

Pseudo Code:

function jumpSearch(array, value, length) {
    step = sqrt(length)
    prev = 0

    // Jumping ahead in blocks
    while array[min(step, length) - 1] < value {
        prev = step
        step += sqrt(length)
        if prev >= length:
            return -1

    // Linear search within the identified block
    while array[prev] < value {
        prev += 1
        if prev == min(step, length):
            return -1

    // Check for element match
    if array[prev] == value:
        return prev

    return -1


  1. Initialization: Start by determining the optimal block size, which is generally the square root of the array's length, to balance between the size of jumps and the length of the linear search.
  2. Jumping: The algorithm advances by blocks until it finds a block where the target could be located or the end of the array is reached.
  3. Block Search: Once the potential block is identified, perform a linear search back from the position at the end of the block to find the exact element.
  4. Match Confirmation: If the element matches the search key, return its index; otherwise, return -1 to indicate the element is not found.

Implementation in C Language

#include <stdio.h>
#include <math.h>

int jumpSearch(int arr[], int x, int n) {
    int step = sqrt(n); // Finding block size to be jumped
    int prev = 0; // Previous block index

    // Jump to the next block
    while (arr[min(step, n)-1] < x) {
        prev = step;
        step += sqrt(n);
        if (prev >= n)
            return -1;

    // Linear search for x within the block starting from the end of the previous block
    while (arr[prev] < x) {
        if (prev == min(step, n))
            return -1;

    // If element is found
    if (arr[prev] == x)
        return prev;

    return -1;

int min(int a, int b) {
    return (a < b)? a : b;

int main() {
    int arr[] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610};
    int x = 55;
    int n = sizeof(arr)/sizeof(arr[0]);
    int index = jumpSearch(arr, x, n);
    printf("Number %d is at index %d\n", x, index);
    return 0;

Explanation of the C Code:

  • Function Definition: jumpSearch function implements the algorithm, handling array traversal using the jump search method.
  • Step Calculation: It calculates the jump step size as the square root of the array size.
  • Jump and Search: The algorithm performs jumps until the block where the element could be and then switches to a linear search within that block.

Time and Space Complexity:

  • Time Complexity: The worst-case time complexity of Jump Search is ๐‘‚(๐‘›)O(nโ€‹), primarily when the target is located near the end of the last block or just before a jump point.
  • Space Complexity: ๐‘‚(1)O(1). Jump Search requires a minimal amount of additional memory, as it primarily operates directly on the input array.

Jump Search is particularly beneficial for:

  • Systems where skip lists are implemented: Because it simulates a skip listโ€™s behavior in a simple array format.
  • Applications requiring quick access but infrequent insertions: Like in static lists used in read-only databases.
  • Search operations on disk-resident datasets: Where minimizing the number of disk accesses (which correspond to jumps in the algorithm) can lead to performance improvements.


Jump Search is an effective search strategy that balances between the extremes of simple linear search and more complex logarithmic searches. It is particularly effective for large sorted arrays where the cost of accessing an element is uniform. By optimizing the number of comparisons performed to find an element, Jump Search can provide a robust alternative for performance-critical applications that manage large datasets.

Subscribe to rahulv.dev | blog

Donโ€™t miss out on the latest issues. Sign up now to get access to the library of members-only issues.
[email protected]