non mutating algorithm Question 1

Last Updated :
Discuss
Comments

What does the lower_bound() function return in C++ STL?

The position of the first occurrence of the given value in an unsorted range.

The position of the last occurrence of the given value in a sorted range.

An iterator to the first element greater than or equal to the given value in a sorted range.

An iterator pointing to the middle element of the range.

This question is part of this quiz :

C++ STL Non-Mutating Algorithms
Tags:
C++ Quiz
C++
Share your thoughts in the comments
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