Linear search has O(n) complexity and Binary search has O(logn) complexity, in Jump search you have to jump backwards only once, hence it is preferable if jumping backwards is costly. Jump search starts from index k (specified index) and searches for the element. It won't start searching from index 0.

This gives a very slight improvement as you are skipping the first k elements.

Tracing with the above code, comparison #1: i=4, comparison #2: i=7, comparison #3: i=8

With every iteration we are dividing the array into two parts(though not equal halves), the complexity remains same as the normal binary search.

Trace with respect to the make_delta function, always note that the last element is always 0.

Uniform binary search code is more complex to implement than binary search as it involves mid points to be computed in hand before search.