Searching Algorithms - Study Mode
[#56] In which of the following case jump search will be preferred over binary search?
Correct Answer
(A) jumping backwards takes significantly more time than jumping forward
[#57] The array is as follows: 1, 2, 3, 6, 8, 10. Given that the number 17 is to be searched. At which call it tells that there's no such element? (By using linear search(recursive) algorithm)
Correct Answer
(A) 7th call
[#58] What is the auxiliary space requirement of the jump search?
Correct Answer
(D) O(1)
[#59] What is the best case and worst case complexity of ordered linear search?
Correct Answer
(D) O(1), O(n)
[#60] What is the time complexity of binary search with iteration?
Correct Answer
(B) O(logn)