Time Complexity

#1

Is their any change in time complexity for inbuilt function.

Like linear search takes O(n) time. What will be the time taken by find() function.

#2

@akhilagg123 time complexity of the inbuilt function is also linear, ie O(n)

#3

@Ishitagambhir thanks a lot…
can u pls tell me what is the time complexity for inbuilt sort function…

#4

hi @akhilagg123

On average, linearithmic in the distance between first and last: Performs approximately N*log2(N) (where N is this distance) comparisons of elements, and up to that many element swaps (or moves).

source: http://www.cplusplus.com/reference/algorithm/sort/

1 Like
#5

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.