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 vote162 views1 answer
Keras backend matrix multiplication
Python
0 vote171 views1 answer
How to count the number of guesses in python
Python
6 votes178 views4 answers
Import user in django
Python
109 votes161 views6 answers
Conda environment
Python
3 votes165 views1 answer
Save clipboard data win32clipboard python
Python
1 vote172 views1 answer
Python selenium web scraping example
Python
4 votes159 views1 answer
Convert pandas datetime to day, weekday, month
Python
0 vote168 views1 answer
Change a color on touch roblox
Python
1 vote243 views1 answer
Sum values in django models
Python Django
0 vote185 views1 answer
How to find xpath by contained text
Python