Find function complexity

#1

is find function equivalent to linear search?

#2

am i supposed to use binary_search function here?..but it returns bool value…how to get index?

#3

hi @akshitabansal321 u can use lower bound to get the first occurance of the value once u are sure the elemnt exits by binary_search function

#4

For an array of size 1024, you can make 10 comparisons at maximum…does lower_bound function fulfill this condition?

#5

yep, it uses binary search @akshitabansal321

#6

why can’t we use only lower_bound function here?

#7

suppose if the element is not there then it will return index of elemnt just greater than lower bound, so its better to check if exists then print the index else print -1 @akshitabansal321

#8

and what about find function? why can’t we use find function only?

#9

@akshitabansal321 its o(n)

#10

ok. got it. thankyou

#11

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.