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

13 votes283 views6 answers
Read pickle file
Python
87 votes312 views6 answers
For loops python
Python
18 votes313 views6 answers
Create new dataframe from existing dataframe pandas
Python
0 vote349 views1 answer
Python assertEqual tuple list
Python
1 vote377 views2 answers
Redirect to the same page django
Python Django
0 vote328 views1 answer
Django model custom field
Python Django
0 vote364 views1 answer
Python: subset top 5 values in a column
Python
1 vote309 views1 answer
What is serialization in django
Python
0 vote292 views1 answer
Python select columns with no na
Python
4 votes326 views5 answers
Current time python
Python