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

0 vote154 views1 answer
Bashrc rc meaning
Python
3 votes161 views3 answers
Pandas date_range
Python
2 votes154 views3 answers
How to print dataframe in python without index
Python
0 vote155 views1 answer
Python similar strings
Python
0 vote144 views1 answer
ValueError: Invalid format specifier
Python
1 vote158 views1 answer
Vector in python
Python
52 votes155 views2 answers
Python find index by value
Python
1 vote142 views1 answer
Decision tree classifier python code for visualization
Python
115 votes145 views6 answers
Pip install python
Python
1 vote166 views1 answer
Pandas read_csv random rows
Python