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

2 votes128 views1 answer
Pandas append index ignore
Python
10 votes182 views6 answers
Flask – Environment
Python Flask
8 votes121 views2 answers
Windows 10 python path
Python
8 votes123 views3 answers
Python execute function from string
Python
0 vote140 views1 answer
Write set to txt python
Python
0 vote127 views1 answer
Paschat opposite sanskrit
Python
9 votes91 views20 answers
Tkinter python
Python
8 votes143 views2 answers
Pandas dataframe get number of columns
Python
0 vote126 views2 answers
Negation of boolean in pyhton
Python
2 votes119 views1 answer
Create Pandas Data Frame in Python
Python