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 vote341 views1 answer
Binary to decimal in Python without inbuilt function
Python
0 vote296 views1 answer
Python using datetime as id
Python
1 vote334 views1 answer
How to check the django version on a mac
Python Django
1 vote325 views6 answers
Python filter function
Python
0 vote287 views1 answer
Compare times python
Python
0 vote378 views1 answer
Is_valid method django
Python
0 vote331 views1 answer
Form action in django
Python Django
0 vote287 views1 answer
Dataframe python diplay 2 tables on same line
Python
1 vote290 views1 answer
Index of max value of sequence python
Python
36 votes283 views1 answer
Sleep in py
Python