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

1 vote142 views1 answer
Divisible in python
Python
28 votes130 views2 answers
Get a slice of string in python
Python
1 vote140 views2 answers
How to append a tuple to a list
Python
1 vote155 views1 answer
That, given an array a of n integers, returns the smallest positive integer (greater than 0) that does not occur in a. python
Python
1 vote137 views1 answer
Python return specific elements from list
Python
10 votes87 views1 answer
Online javascript to typescript compiler
Python
6 votes145 views2 answers
Python square a number
Python
0 vote126 views1 answer
Sentiment analysis french python
Python
0 vote147 views1 answer
How to show webcam in opencv
Python
0 vote135 views1 answer
Tkinter auto resize height
Python