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 vote149 views1 answer
Student notebook (finish), INB (finish), Food and Fitness log (log necessary), debate speech (finish)
Python
0 vote142 views1 answer
Pysft connection drop issue
Python
4 votes144 views4 answers
How to change django admin text
Python
0 vote149 views2 answers
Matplotlib grid in background
Python
0 vote146 views1 answer
Python Sorted Word frequency count
Python
0 vote145 views1 answer
Gym for creating simple grid world
Python
1 vote155 views1 answer
Tracking mouse position tkinter python
Python
0 vote157 views1 answer
Generate all combinatinosrs of a list pyton
Python
2 votes137 views1 answer
Remove rows or columns with NaN value
Python
0 vote145 views2 answers
Converting list of arrays with same size to single array python
Python