python sort complexity

1nlog2n. 
2
3As others have mentioned, the built-in sorting algorithm of Python uses a special version of merge sort, called Timsort, which runs in  nlog2n  time.
4
5That’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).
6
7You can read more about how Timsort works (it’s pretty cool!) here: