Time Complexity in Python

#1

there are 3 methods given to merge 2 sorted array

i want to know which one is best?

is there is something like time Complexity in python also as in c++

also tell time complexity of each method

Thanks

#2

Yes, the concepts of Time Complexity are independent of language and are equally applicable in Python.

Let’s assume we have 2 lists of size n and m.
Time complexity of the first method is O(n+m).
For the other two, it is O((n+m) log(n+m)).
The time complexity of the first method is far better and should always be preferred when implementing merge sort.

Hope this helps!

#3

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.