ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
What is the time complexity of the Quick search algorithm?
Correct Answer: C — O(m+n)
The time complexity of the Quick search algorithm is O(m+n), which is proven to be faster than Boyer-Moore's algorithm.