Binary Search time complexity O(N)!

#1

in the quiz answer, it is given that the inbuilt binary_search function takes O(N) to find the index of an element. I think it should be O(log(N)).

#2

@Avi-Kasliwal-315786729062203 hey ,you are correct it should be O(log(n)) ,ans galat hoga.