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

36 votes205 views6 answers
Arrays in python
Python
5 votes240 views2 answers
String to binary python
Python
1 vote221 views1 answer
Ctypes run as administrator
Python
5 votes226 views3 answers
Correlation python
Python
0 vote241 views1 answer
Python def text
Python
2 votes220 views2 answers
Combination without repetition python
Python
1 vote208 views1 answer
Import numpy financial python
Python
1 vote224 views1 answer
Counter in django template
Python Django
37 votes212 views6 answers
Turn list into string
Python
4 votes204 views1 answer
Python float to fraction
Python