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

1 vote376 views1 answer
How to get the user ip in djagno
Python
0 vote352 views1 answer
How to discover which index labels are in other
Python
0 vote310 views1 answer
How to open html file in python
Python
-1 vote333 views1 answer
Rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrooom
Python
-1 vote360 views2 answers
Python diagonal sum
Python
0 vote400 views1 answer
SparkSession pyspark
Python
0 vote326 views1 answer
Only size-1 arrays can be converted to python scalars
Python
2 votes313 views1 answer
Discard vs remove python
Python
0 vote309 views1 answer
Radio button selected event
Python
0 vote314 views1 answer
A string varible in python
Python