- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Top | MCQs on Binary Search Algorithm with Answers | Question 10
Last Updated :
Discuss
Comments
The time taken by binary search algorithm to search a key in a sorted array of n elements is
O ( n log2n )
O ( n )
O ( n^2)
O(log2n)
This question is part of this quiz :
Top MCQs on Binary Search Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy