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

0 vote353 views1 answer
Cv2 assertion failed
Python
0 vote336 views1 answer
List variables in session tensorflow 1
Python
11 votes358 views3 answers
Discord rich presence python
Python
91 votes343 views6 answers
How to create a virtual environment in python
Python
21 votes281 views1 answer
Raise en python
Python
7 votes335 views4 answers
Pandas.get_dummies
Python
1 vote398 views1 answer
Django making a custom 403 page
Python Django
0 vote332 views1 answer
How to send file in django response
Python
0 vote334 views1 answer
Unction which takes in a list of integers and returns a dictionary of the five number summary..
Python
6 votes341 views4 answers
How to encrypt text in python
Python