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

2 votes233 views1 answer
Alex john
Python
0 vote234 views2 answers
Adding labels to histogram bars in matplotlib
Python
0 vote186 views1 answer
Python site-packages pyspark
Python
1 vote231 views8 answers
Fadaei
Python
0 vote257 views1 answer
Check if a date is reached django
Python Django
0 vote219 views1 answer
Save impt
Python
16 votes222 views5 answers
Add two dataframes together
Python
87 votes234 views6 answers
For loops python
Python
0 vote219 views1 answer
Gene wilder pure imagination
Python
0 vote178 views1 answer
Geopy set proxy
Python