ALgorithm Quiz Q2 Time complexity of binary search stl

#1

IN Q2, time complexity of binary search stl should be logarithmic to the size of list but the correct answer is given as linear to the size of the list

#2

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