51. What is the worst case runtime of linear search(recursive) algorithm?
52. Given an array arr = {5, 6, 77, 88, 99} and key = 88; How many iterations are done until the element is found?
53. What is the length of the step in jump search?
54. Given an array arr = {45, 77, 89, 90, 94, 99, 100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
55. What is the time complexity of exponential search when the input array is sorted but the values are not uniformly distributed?
56. What is the value of jump taken for maximum efficiency while implementing jump search?
57. Which of the following step is taken after finding an element having value greater than the element being searched?
58. Given, arr = {1, 3, 5, 6, 7, 9, 14, 15, 17, 19} key = 17 and delta = {5, 3, 1, 0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
59. Binary Search can be categorized into which of the following?
60. What is the auxiliary space requirement of interpolation search?
Read More Section(Searching Algorithms)
Each Section contains maximum 100 MCQs question on Searching Algorithms. To get more questions visit other sections.