How many comparisons does binary search make in the worst case to determine if a target value is present in a sorted array of 1,024 elements?
Answer and explanation
Correct answer: D. 11
- Step 1: Calculate the maximum search depth of binary search: .
- Step 2: For , the worst-case number of iterations is comparisons.
Answer
11.
Why not the others: 1,024 is the linear search worst case; 512 is the first division point; 100 is an arbitrary number.
Practise more Algorithms and Python Programming.
Free questions with an explanation for every one, and full timed EmSAT Achieve (UAE) mock tests.
More Algorithms and Python Programming questions
- What is the output of the following Python expression: [x**2 for x in range(6) if x % 2 != 0]?
- What is the worst-case time complexity of searching for an element in a balanced binary search tree (AVL tree) containing n nodes?
- What will be printed by the following Python code snippet?
def func(val, lst=[]):
lst.append(val)
return lst
print(func(1))
print(… - Which abstract data structure operates on a First-In, First-Out (FIFO) ordering principle?
- What is the return value of executing the recursive Python function `mystery(4)`?
def mystery(n):
if n <= 1:
return 1
retur… - What is the worst-case time complexity of the standard QuickSort algorithm when the chosen pivot is consistently the smallest or largest ele…