Jump Search Algorithm

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

The average case time complexity is O(√N) and the auxilary space complexity is O(1).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/jump-search-algorithm/