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 vote197 views2 answers
Www.pd.date_range
Python
0 vote224 views1 answer
Learn jinja2
Python
0 vote208 views10 answers
Python pygeoip example
Python
2 votes168 views2 answers
Python threading return value
Python
9 votes220 views2 answers
How to get sound in python
Python
0 vote209 views1 answer
Flask decoding base 64 image
Python
3 votes195 views1 answer
Create a window turtle python
Python
1 vote191 views1 answer
How to capture an image with web cam open cv
Python
0 vote211 views1 answer
How can space be bent
Python
1 vote197 views1 answer
ModuleNotFoundError: No module named 'rospkg'
Python