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 vote174 views1 answer
Python break out of function
Python
0 vote197 views1 answer
What takes more memory string or list python
Python
3 votes182 views1 answer
Python loop through column in dataframe
Python
0 vote191 views1 answer
Replace substrings in python
Python
74 votes186 views2 answers
Find string in string python
Python
1 vote177 views2 answers
If condition in print statement python
Python
1 vote227 views2 answers
TypeError: list indices must be integers or slices, not str
Python
0 vote186 views1 answer
Python skip input
Python
0 vote233 views1 answer
Internet spam
Python
0 vote174 views1 answer
Setting flask app environment variable
Python