Sorts an entire array using the default comparison for the type
Modulevector-algorithms-0.9.1.0Haskell2010
Data.Vector.Algorithms.Insertion
A simple insertion sort. Though it's O(n^2), its iterative nature can be beneficial for small arrays. It is used to sort small segments of an array by some of the more heavy-duty, recursive algorithms.
Synopsis
- value sort
- value sortUniq
- value sortBy
- value sortUniqBy
- value sortByBounds
- value sortByBounds'
- type Comparison
- Packagevector-algorithms-0.9.1.0
- Exports7
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceInsertion.hs
A variant on sort that returns a vector of unique elements.
Sorts an entire array using a given comparison
A variant on sortBy which returns a vector of unique elements.
Sorts the portion of an array delimited by [l,u)
Sorts the portion of the array delimited by [l,u) under the assumption that [l,m) is already sorted.
A type of comparisons between two values of a given type.