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