Category
page 1Stable sorts
bubble sort
simple sorting algorithm
merge sort
worst-case optimal stable divide and conquer comparison sorting algorithm
insertion sort
sorting algorithm that, at each iteration, inserts the current input element into the suitable position between the already sorted elements
radix sort
non-comparative sorting algorithm
counting sort
sorting algorithm
cocktail shaker sort
sorting algorithm
bucket sort
Sorting algorithm
gnome sort
sorting algorithm
odd–even sort
sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
pigeonhole sort
sorting algorithm
Timsort
Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It was implemented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsequences of the data that are already ordered (runs) and uses them to sort the remainder more efficiently. This is done by merging runs until certain criteria are fulfilled. Timsort was Python's standard sorting algorithm from version 2.3 until it was replaced in 3.11 by Powersort, a derived algorithm with a more robust merge policy. Timso
library sort
sorting algorithm