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 vote441 views1 answer
Flask_uploads.exceptions.UploadNotAllowed
Python Flask
0 vote350 views1 answer
Tyjacsav
Python
-1 vote339 views1 answer
Rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrooom
Python
0 vote362 views1 answer
Get time format python2 hours minutes seconds milliseconds
Python
2 votes350 views2 answers
Python exception element not found
Python
1 vote348 views1 answer
Python sorted dictionary multiple keys
Python
0 vote339 views1 answer
Simplest flask memcached
Python
0 vote326 views1 answer
Which function is used to read single line from file?
Python
4 votes335 views2 answers
Godot string format
Python
14 votes339 views3 answers
Minimum and max value in all columns pandas
Python