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 vote229 views2 answers
Jama python rest api
Python
2 votes217 views2 answers
Argparse multiple arguments as list
Python
0 vote244 views1 answer
Get panda df as a string csv
Python
0 vote293 views1 answer
Ticklabels are not centered heatmap
Python
2 votes246 views1 answer
Frequency count of values in pandas dataframe
Python
0 vote292 views1 answer
RuntimeError: cannot open featureclass in python
Python
0 vote228 views1 answer
Multivariable traces f(x, y) = sin(x)cos(y)
Python
0 vote243 views1 answer
Unsupported media type django
Python
0 vote231 views1 answer
Number of unique pairs in columns pandas
Python
0 vote240 views1 answer
Label with list comprehension python
Python