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

31 votes121 views6 answers
Python dataframe sort by column name
Python
-1 vote103 views2 answers
Reading tsv file in python
Python
0 vote95 views2 answers
Sqlite to python list
Python
0 vote98 views1 answer
E: Package 'python-certbot-nginx' has no installation candidate
Python
5 votes102 views2 answers
How to plot pie chart in python
Python
40 votes101 views5 answers
Round decimal to 2 places python
Python
0 vote91 views1 answer
Use of numpy matrix in tkinter python 3
Python
0 vote97 views1 answer
Python list fill nan
Python
0 vote126 views1 answer
Pandas view full dataframe
Python
14 votes133 views6 answers
Pandas merge df
Python