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 vote218 views1 answer
Collecting candies codevita solution in python
Python
2 votes204 views2 answers
Merge two columns name in one header pandas
Python
0 vote211 views1 answer
Can only use .str accessor with string values!
Python
1 vote238 views1 answer
Combination python
Python
1 vote190 views3 answers
Inheritance in python 3 example
Python
0 vote220 views1 answer
List reverse method in python
Python
52 votes212 views6 answers
Python sleep
Python
2 votes199 views1 answer
Django override delete
Python
0 vote207 views1 answer
Py convert binary to int
Python
0 vote196 views1 answer
Python ip location lookup
Python