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 vote251 views1 answer
Vreverse all elemetns of a list in place python
Python
44 votes242 views3 answers
How can I sort a dictionary in python according to its values?
Python
8 votes282 views1 answer
Find sum of 2 numbers in array using python
Python
1 vote248 views1 answer
How to loop back to try except python
Python
2 votes266 views2 answers
Discord.py cog
Python
3 votes303 views2 answers
AttributeError: module 'tensorflow' has no attribute 'GraphDef'
Python
1 vote254 views1 answer
Sort by column dataframe pyspark
Python
0 vote286 views1 answer
Python reverse split only once
Python
0 vote277 views1 answer
Find maximum element in stack
Python
39 votes250 views2 answers
String to list of characters python
Python