sort
Module containing 17 high-performance sorting algorithm implementations.
Functions
def bubble_sort(arr) / cocktail_shaker_sort(arr) / odd_even_sort(arr)
Comparison-based iterative exchange sorting algorithms.
def quicksort(arr) / merge_sort(arr) / heapsort(arr) / introsort(arr) / timsort(arr)
Efficient logarithmic divide-and-conquer and hybrid sorting algorithms.
def counting_sort(arr) / bucket_sort_uniform(arr) / pigeonhole_sort(arr) / bead_sort(arr)
Non-comparison distribution sorting algorithms.