- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
non mutating algorithm Question 9
Last Updated :
Discuss
Comments
Which of the following is TRUE about the binary_search() function in C++ STL?
It can search for an element in an unsorted container.
It has a time complexity of O(n).
It always returns an iterator pointing to the found element.
It requires the container to be sorted before searching.
This question is part of this quiz :
C++ STL Non-Mutating AlgorithmsShare 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