Isn’t the complexity of binary search logarithmic of input size?
Why does the correct answer here show Linear time complexity?
STL Quiz - complexity of binary_search()
hello @Rajat-Singla-2028006823881434
its time complexity will be O(n)
reason->
list stl is like linked list i.e we cannot ranomly access any element . if we want to access any element then we need to traverse from start of the list to reach that particular node.
Now because we are applying binary search on list.
getting mid element will be O(n) // o(n) because to get mid element we need to traverse half of the list .
so the recurrence relation for this problem will be
T(N)=T(N/2) + O(n)
on solving this relation u will get
T(n)=O(n)
great explanation. Thank you 