What algorithm does python's sorted() use?

Question

I'm attempting to disclose to somebody why they should use Python's built-in sorted() function as opposed to moving their own, and I understood I have no clue about what algorithm it uses and we're talking about Python 2.7

Answer 1

Python actually uses an algorithm, so called Timsort.

Timsort is actually a hybrid sorting algorithm, gotten from merge sort and insertion sort, intended to perform well on numerous sorts of true information. It was created by Tim Peters in 2002 for use in the Python language. The algorithm also discovers subsets of the information that are now requested, and utilizes the subsets to sort the information all the more proficiently. This is finished by merging a distinguished subset, called a run, with existing runs until specific rules are satisfied. Since the version of 2.3, Timsort was considered as the python's standard sorting algorithm. It is currently likewise used to sort exhibits in Java SE 7, and on the Android platform.

Looking for a good python tutorial course? Join the python certification course and get certified.

For more details, do check out the below video tutorial...