binary search has 0(logn) complexity but here it says that its linear how??
Complexity of binary_search
Can you attach the name of the video or the question from the STL quiz, so I can take a look at it.
@aashi Binary search is O(logn), if anywhere it is mentioned that it is O(n) then their must be some kind of mistake on their part.
Binary search and most of its associated algorithms(Upper_bound, lower_bound etc) work in O(Logn)
If this resolves your doubt mark it as resolved.