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 vote116 views4 answers
How to loop over all dates in python
Python
0 vote118 views1 answer
Using strip() method to remove the newline character from a string
Python
0 vote116 views1 answer
Python get num chars
Python
39 votes108 views4 answers
Convert datetime to date python
Python
15 votes111 views2 answers
Post request in python flaks
Python
1 vote115 views1 answer
Python import all words
Python
2 votes103 views2 answers
Fibonacci using function in python
Python
0 vote107 views1 answer
Multiplication of two or more numbers in python
Python
82 votes114 views6 answers
Arch Linux
Python
5 votes112 views1 answer
2set
Python