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 vote144 views1 answer
How to display speechmarks in python string
Python
11 votes211 views2 answers
Find character in python
Python
1 vote179 views2 answers
Rank function in pandas
Python
0 vote207 views1 answer
Import ArraField django
Python Django
0 vote172 views1 answer
Python function pointer with multiple args
Python
3 votes191 views2 answers
Python 3 numbers of a range is even
Python
5 votes204 views2 answers
Python string replace by index
Python
8 votes216 views3 answers
Pd merge on multiple columns
Python
0 vote181 views1 answer
Python scatter plot legend
Python
0 vote226 views2 answers
Zbarge / s3gui
Python