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

25 votes238 views3 answers
Startapp django
Python Django
0 vote95 views2 answers
Odoo wizard current user login
Python
25 votes97 views4 answers
Python iterate directory
Python
6 votes159 views4 answers
Openpyxl
Python
0 vote103 views2 answers
Empty set in python
Python
0 vote120 views1 answer
Plotly facet_grid python
Python
15 votes106 views1 answer
Python add to list with index
Python
0 vote97 views1 answer
Python index of lowest value in list
Python
0 vote103 views1 answer
Get timestamp with pyrhon
Python
0 vote106 views1 answer
How to go to previous directory in os python
Python