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

19 votes269 views1 answer
Get requests from python
Python
0 vote281 views1 answer
Python String with Alphanumeric characters
Python
0 vote327 views1 answer
Extract area code from phone number python
Python
0 vote293 views1 answer
How to track hands python opencv/mediapipe
Python
-1 vote292 views1 answer
Flask set mime type
Python
19 votes262 views1 answer
Python turn of userwarning
Python
-1 vote266 views1 answer
Python random item of an array
Python
0 vote272 views1 answer
Directory corrente python
Python
3 votes289 views1 answer
How to make a star in python turtle
Python
1 vote276 views1 answer
How to include specific data type from the dataframe
Python