Question #2 in Algorithms STL Quiz

#1

Why the time complexity of binary_search() built-in function is linear in size of the list instead of logarithmic?

#2

hello @halihoof
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)

1 Like
#3

@aman212yadav
Oh, it’s a list. I got it.
Thank you so much