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 vote257 views1 answer
Python convert string to path
Python
0 vote263 views1 answer
Ejercicios con def en python
Python
0 vote277 views2 answers
Problems on loops and if else statements
Python
0 vote278 views1 answer
Python get cos sim
Python
2 votes257 views2 answers
ValueError: Shapes (None, 1) and (None, 11) are incompatible keras
Python
2 votes281 views3 answers
Get binary string python
Python
0 vote279 views1 answer
Verbose python
Python
0 vote236 views1 answer
Ros python service client
Python
0 vote271 views2 answers
Python divide array into n parts
Python
41 votes258 views5 answers
UnicodeDecodeError: 'charmap' codec can't decode byte 0x81 in position 92: character maps to <undefined>
Python