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

42 votes201 views3 answers
Python get command line arguments
Python
40 votes173 views5 answers
New line print python
Python
5 votes206 views2 answers
Python convert string to yaml
Python
1 vote191 views1 answer
Create django group
Python Django
12 votes189 views4 answers
Key pressed pygame
Python
0 vote168 views1 answer
Global variable not accessible withing thread
Python
0 vote154 views1 answer
Import get object
Python
0 vote183 views1 answer
Css selenium
Python
0 vote171 views1 answer
Python scrape data from aspx page
Python
0 vote188 views1 answer
Pandas make currency with commas
Python