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 vote153 views1 answer
Flask set mime type
Python Flask
0 vote135 views1 answer
Python multiline comment using docstrings
Python
25 votes103 views4 answers
Python iterate directory
Python
0 vote111 views1 answer
Python session set cookies
Python
0 vote113 views1 answer
Setting up a django prostgress project
Python
0 vote96 views1 answer
Python tkinter importieren
Python
0 vote118 views1 answer
Fluffy ancake recipe
Python
0 vote111 views1 answer
Iterate through python string starting at index
Python
0 vote147 views1 answer
When to use finally python
Python
32 votes114 views6 answers
Add to list python
Python