STL Quiz, question 2

#1

This question uses binary search, however the correct answer is " output is 1 with linear time complexity" instread of logarithmic time complexity.
Please guide as to how we reach this correct answer. (since binary search complexity is logarithmic)

#2

@ilovetocode calculating mid pt in list is o(n) thats why

#3

ohk…thanks for your help!

#4

@ilovetocode you are welcome