+1 vote
in Data Structures & Algorithms II by (110k points)
How can Jump Search be improved?

(a) Start searching from the end

(b) Begin from the kth item, where k is the step size

(c) Cannot be improved

(d) Step size should be other than sqrt(n)

This question was addressed to me in final exam.

This intriguing question comes from Uniform Binary Search topic in portion Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct choice is (b) Begin from the kth item, where k is the step size

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

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.

Categories

...