+1 vote
in Data Structures & Algorithms II by (110k points)
Jumps are made in the jump search algorithm until ___________

(a) element having value less than that of the required element is found

(b) element having value equal to the median of values of the array is found

(c) element having value greater than that of the required element is found

(d) middle element is found equal to the element being searched

The question was asked by my school teacher while I was bunking the class.

I'd like to ask this question from Searching topic in section Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct answer is (c) element having value greater than that of the required element is found

Easiest explanation - In jump search algorithm jumps are made until element having value greater than the value of element being searched is found. After this linear search is performed in backwards direction.

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

...