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 vote359 views1 answer
Django today date in template
Python Django
1 vote228 views1 answer
Cannot import name 'joblib' from 'sklearn.externals' (/shared-libs/python3.7/py/lib/python3.7/site-packages/sklearn/externals/__init__.py)
Python
1 vote283 views1 answer
Why for loop is not iterating python all values
Python
-1 vote232 views1 answer
Image analysis python
Python
0 vote273 views1 answer
Python socket set title
Python
0 vote300 views1 answer
Tf MaxPooling2D
Python
0 vote322 views1 answer
Una esfera solida de radio 40 cm tiene una carga positiva
Python
0 vote298 views1 answer
Python sleeping with a varible
Python
1 vote303 views1 answer
How to declare private attribute in python
Python
1 vote272 views1 answer
Write data to using pickle
Python