Jump Search

[J-e-e-t]

🚀 Feature

Jump Search is a searching algorithm for sorted arrays. The basic idea is to check fewer elements (than linear search) by jumping ahead by fixed steps or skipping some elements in place of searching all elements.

Have you read the Contribution Guidelines?

YES

Pitch

In Jump search, Instead of traversing the whole array one by one in linear fashion, we traverse the array by jumping ahead with fixed size steps to find the required element in less number of steps.It has an advantage in terms of Time complexity over Linear search.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @J-e-e-t
Go -
Java -
Javascript -
Kotlin -
Python -

[J-e-e-t]

please assign me this Issue in c++

[manan025]

@J-e-e-t - C++ assigned

[A-Spiral-Forge]

please assign me this Issue in python

[prithindevotta]

@manan025 I'd like to contribute in java