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 vote137 views1 answer
Mat.at(row,col) Opencv
Python
1 vote187 views1 answer
Celery flower notimplementederror
Python
5 votes132 views1 answer
Mutable and immutable in python
Python
3 votes164 views2 answers
Python save a dictionary as an object
Python
0 vote125 views1 answer
How to get synonyms of a word in python
Python
0 vote164 views1 answer
Discord pycord add a URL button in a subclassed view
Python
1 vote131 views1 answer
How to get prime numbers in a list in python using list comprehension
Python
1 vote214 views1 answer
Using df.astype to select categorical data and numerical data
Python
0 vote141 views1 answer
"jupyter (notebook OR lab)" ipynb "not trusted"
Python
0 vote177 views1 answer
Flask debugtoolbar
Python Flask