The Average-case Time Complexity of the binary search algorithm is-

A O(n/2 logn)

B O(n log n)

C O(log n)

D O(1)

Solution

Correct Answer: Option C

Practice More Questions on Our App!

Download our app for free and access thousands of MCQ questions with detailed solutions

Download Android App Login to Website

Related Topics