What is the time complexity of the Quick search algorithm?
O(n)
O(log n)
O(m+n)
O(mn)
Correct Answer: C — O(m+n)
Explanation:
The time complexity of the Quick search algorithm is O(m+n), which is proven to be faster than Boyer-Moore's algorithm.
