# sorting library

A collection of list sorting algorithms.

## Functions

bubbleSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the bubble sort algorithm.
cocktailShakerSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the Cocktail shaker sort with a few improvements over the base algorithm.
combSort<E>(List<E> list, {int? begin, int? end, double shrinkFactor = 2.2, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the Comb sort algorithm.
countingSort(List<int> list, {int? begin, int? end, bool reversed = false}) → void
Sorts a `list` of integer numbers of small range using the counting sort algorithm.
countingSortOf<E>(List<E> list, KeyOf<E, int> keyOf, {int? begin, int? end, bool reversed = false}) → void
Sorts any `list` of items using counting sort algorithm.
gnomeSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the gnome sort algorithm.
insertionSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the insertion sort algorithm.
mergeSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare, int threshold = 8}) → void
Sorts the `list` of numbers using the merge sort algorithm with a few optimizations.
quickSortHaore<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare, int threshold = 32}) → void
Sorts the `list` of numbers using the quicksort algorithm following Hoare partition scheme with several optimizations.
quickSortLomuto<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare, int threshold = 32}) → void
Sorts the `list` of numbers using the quicksort algorithm following Lomuto partition scheme with several optimizations.
radixSort(List<int> list, {int? begin, int? end, bool reversed = false, int? radixPower}) → void
Sorts a `list` of integer numbers using the radix sort algorithm with a radix value of `2^p`.
radixSortOf<E>(List<E> list, KeyOf<E, int> keyOf, {int? begin, int? end, bool reversed = false, int? radixPower}) → void
Sorts any `list` of items using radix sort algorithm with a radix value of `2^p`.
selectionSort<E>(List<E> list, {int? begin, int? end, Comparator<E>? compare}) → void
Sorts the `list` of numbers using the selection sort algorithm.