Jump search algorithm | Searching algorithms

Jump searching algorithm | Searching Algorithms

Advantages:

1. It is faster than the linear search technique which has a time complexity of O(n) for searching an element

Disadvantages:

1. It is slower than binary search algorithm which searches an element in O(log n)2
2. It requires the input array to be sorted

Key Points:

1. This algorithm works only for sorted input arrays
2. Optimal size of the block to be skipped is √n, thus resulting in the time complexity O(√n2)
3. The time complexity of this algorithm lies in between linear search (O(n)) and binary search (O(log n))
4. It is also called block search algorithm

For video on particular topic, comment the topic and I will explain it asap.

If the video helped you in anyway, consider subscribing to the channel.

#forcs #algorithms #coding #learning #programming #searching #cs #developer #engineering #jumpSearching