+1 vote
in Data Structures & Algorithms II by (110k points)
How many jumps will be made in the worst case of jump search(let block jumped =k)?

(a) n*k

(b) n/k

(c) k/n

(d) n+k

This question was posed to me by my school principal while I was bunking the class.

Question is taken from Searching in chapter Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
The correct answer is (b) n/k

The best explanation: Worst case occurs when the value to be searched is in the last section of the array. So, in this case the number of jumps will be n/k.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.