|
Data.Array.Vector.Algorithms.Insertion | Portability | Portable | Stability | Experimental | Maintainer | Dan Doel |
|
|
|
Description |
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 |
|
|
|
Documentation |
|
|
Sorts an entire array using the default comparison for the type
|
|
|
Sorts an entire array using a given comparison
|
|
|
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.
|
|
Produced by Haddock version 2.4.2 |