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 vote347 views1 answer
Python send sigint to subprocess
Python
1 vote275 views1 answer
Python jwt
Python
1 vote298 views1 answer
Django templateview
Python Django
19 votes353 views6 answers
Install Django Windows
Python Django
1 vote260 views1 answer
Array of dic
Python
9 votes269 views4 answers
Python numpy array
Python
0 vote265 views1 answer
Pythagorean theorem calc: find c, a=n
Python
10 votes256 views3 answers
Write json pythonb
Python
1 vote293 views1 answer
Django clear db
Python Django
0 vote261 views1 answer
Numpy distance of consecutive elements
Python