x = [1, 4, 7, 65, 23, 57, 12]
>>> sorted(x)
[1, 4, 7, 12, 23, 57, 65]
Just out of curiosity, how does this function work? What is the algorithm that Python uses to sort iterables?
Python used to use Quicksort.
Then, the mighty Tim Peters came along, with a level 20 keyboard and coding chops that were over 9000; and in a magnificent symphony of elegance and brilliance, built Timsort and gifted it to us mere mortals, for our lives would be incomplete without it.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With