Time complexity of binary search

#1

sir plz tell if there comes any extra space if we use binary_search(arr,arr+n,x) STL and in lower_bound and in upper_bound these are O(1) or O(long) space STL

#2

hello @goo-mico.100
binary search and lower bound both works in O(1) space

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.