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

39 votes134 views3 answers
ModuleNotFoundError: No module named 'matplotlib'
Python
0 vote127 views1 answer
How to access http page in pythion
Python
5 votes124 views2 answers
Run python script from bash script
Python
0 vote176 views1 answer
How to create a spark schema using a string
Python
5 votes139 views3 answers
Iterating with index in for loops python
Python
0 vote156 views1 answer
Python mongodb docker
Python
0 vote206 views2 answers
Types of methods in oop python
Python
21 votes245 views4 answers
Flask quickstart
Python Flask
0 vote121 views1 answer
Fetch firestore indexes
Python
0 vote127 views1 answer
Reportlab line thickness
Python