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

3 votes170 views3 answers
Pytest
Python
1 vote142 views2 answers
How to sort nested list in python
Python
-1 vote173 views1 answer
Ga in python
Python
51 votes133 views4 answers
Get date from datetime python
Python
0 vote152 views1 answer
Check if entry is NaT]
Python
21 votes194 views2 answers
Run python file using python code
Python
18 votes154 views5 answers
Get list with random numbers python
Python
0 vote153 views1 answer
Dictionary Get All Keys
Python
0 vote146 views1 answer
From Player import Player
Python
87 votes134 views6 answers
Activate virtual environment python
Python