What is the space complexity of the Quick search algorithm?
O(n)
O(log n)
O(m+n)
O(mn)
Correct Answer: A — O(n)
Explanation:
The space complexity of the Quick search algorithm is O(n), where n represents the input size.
