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 vote356 views1 answer
Median absolute deviation python
Python
0 vote307 views2 answers
Register temporary table pyspark
Python
0 vote317 views1 answer
Convert files from jpg to png and save in a new directory python
Python
80 votes323 views5 answers
Random.shuffle
Python
0 vote311 views2 answers
Feature selection python
Python
0 vote320 views1 answer
Django test imagefield
Python
12 votes313 views2 answers
How to shutdown a windows 10 computer using python
Python
0 vote334 views1 answer
How to resize windows in python
Python
0 vote333 views2 answers
Python script in excel
Python
0 vote328 views1 answer
Build the union of a list of RDDs
Python