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 vote324 views1 answer
Pyautogui color
Python
1 vote257 views1 answer
What is .new() is used in python
Python
0 vote325 views1 answer
Python developer salary
Python
0 vote315 views1 answer
Python exe not working on other pc
Python
1 vote322 views1 answer
Get video length python
Python
0 vote317 views1 answer
Python run things at certain datetimes
Python
0 vote342 views1 answer
Mechanize python XE #28
Python
0 vote304 views1 answer
Get first not null value from column dataframe
Python
10 votes297 views1 answer
Convert numpy to torch
Python
5 votes335 views3 answers
Python hide console
Python