Question

What will be the maximum number of comparisons that can be made in jump search algorithm (assuming k to be blocks jumped)?

(a) k

(b) n/k

(c) k-1

(d) k-1

Answer 1

Right choice is (c) k-1

Explanation: Worst case occurs when the element being searched is present just after the element that has been compared while making the last jump. So, in this case k-1 comparisons will have to be made.