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

19 votes231 views6 answers
Python server
Python
2 votes266 views1 answer
Convert int to byte python
Python
1 vote271 views1 answer
Python cffi install
Python
0 vote255 views1 answer
Python split string every character
Python
61 votes236 views4 answers
Python sort a dictionary by values
Python
0 vote254 views1 answer
ImportError: No module named colored
Python
24 votes260 views6 answers
Display all rows pandas
Python
0 vote280 views1 answer
Visitor IP address django
Python Django
7 votes272 views1 answer
Python join paths
Python
0 vote265 views1 answer
Limit characters in django template
Python