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 vote131 views3 answers
Java random 6 digit number
Python
2 votes126 views1 answer
Hibernate windows with python
Python
0 vote124 views1 answer
Python amino acid dictionary
Python
0 vote134 views1 answer
Disable json dumps encode
Python
2 votes145 views1 answer
Change false to true python
Python
0 vote179 views1 answer
Get token from request django
Python Django
0 vote158 views1 answer
Python xml to csv
Python
0 vote117 views1 answer
Monoamine oxidase inhibitor
Python
0 vote119 views1 answer
Dinoscape für pc
Python
1 vote134 views1 answer
Creating folder in s3 bucket python
Python