Python sort complexity

nlog2n. 

As others have mentioned, the built-in sorting algorithm of Python uses a special version of merge sort, called Timsort, which runs in  nlog2n  time.

That’s pretty good; we generally can’t get much better than  nlog2n (with the exception of sorts which are slightly optimized for certain arrangements of data).

You can read more about how Timsort works (it’s pretty cool!) here:

Similar codes

8 votes178 views1 answer
Python find runtime
Python
-1 vote202 views2 answers
HeapSort
Python
5 votes191 views1 answer
Dataframe from arrays python
Python
0 vote195 views1 answer
Compute condition number python
Python
12 votes245 views6 answers
Python flask
Python Flask
0 vote192 views2 answers
Pyspark average group by
Python
0 vote193 views1 answer
Tensorflow turn off gpu
Python
-1 vote196 views1 answer
Can only use .dt accessor with datetimelike values
Python
0 vote189 views1 answer
Python TypeError: function takes positional arguments but were given
Python
0 vote176 views1 answer
Pickle.load from gpu device to cpu
Python