What is the space complexity of an iterative binary search algorithm implemented without recursion on an array of size n?
Answer and explanation
Correct answer: B. O(1)
- Step 1: Analyze memory allocation during iterative binary search.
- Step 2: The algorithm uses a fixed number of pointer variables (`low`, `high`, `mid`) and operates directly on the existing array in place without call stack frames, requiring auxiliary space.
Answer
O(1).
Why not the others: space is consumed by recursive binary search due to call stack frames; is auxiliary array copying.
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…