Searching · Class 12 · CBSE · Science Computer Science
In binary search on an ascending sorted list, what should be done when a[mid] is less than the target value x?
Practice question from Searching (Class 12 · CBSE · Science Computer Science), with the correct answer and a step-by-step solution.
medium · MCQ · Q-AE88AC
In binary search on an ascending sorted list, what should be done when a[mid] is less than the target value x?
- A.Set high = mid - 1
- B.Set low = mid + 1Correct answer
- C.Set low = mid - 1
- D.Stop the search because x is absent
Solution
Since the list is in ascending order, all elements at or before mid are less than x. The search must continue in the right portion by setting low = mid + 1.
More from Searching
- What is printed by the following Python code? def linearsearch(a, x): for i in range(len(a)): if a[i] == x: return i return -1 print(linear…
- Consider the following binary search function and list: def binarysearch(a, x): low, high = 0, len(a) - 1 while low <= high: mid = (low + h…
- Why must the data be sorted before applying binary search? Also compare the worst-case time complexity of binary search with that of linear…
- In an iterative linear search, what value is printed by the following Python code? def countchecks(a, x): checks = 0 for value in a: checks…
Practise more Computer Science
Sign up free for adaptive practice on this chapter, with instant feedback and hints on every question.
Start practising freeFree to start · No credit card needed