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 vote165 views1 answer
Pvector python processing
Python
1 vote166 views1 answer
Cannot import name 'imputer'
Python
0 vote149 views1 answer
Doc2text python example
Python
3 votes210 views2 answers
Initialise a 2d array python
Python
34 votes176 views2 answers
Python shuffle list with seed
Python
29 votes168 views9 answers
Traduttore
Python
1 vote150 views1 answer
Python tomorrow
Python
3 votes166 views5 answers
Get object attributes python
Python
0 vote164 views1 answer
Use the "map" function to find all the odd numbers and the even numbers in the list. Print 0 for odd and 1 for even. in python
Python
2 votes155 views1 answer
Df count missing values
Python