Portability	Portable
Stability	Experimental
Maintainer	Dan Doel

Data.Array.Vector.Algorithms.Insertion

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

sort :: (UA e, Ord e) => MUArr e s -> ST s ()Source

Sorts an entire array using the default comparison for the type

sortBy :: UA e => Comparison e -> MUArr e s -> ST s ()Source

Sorts an entire array using a given comparison

sortByBounds :: UA e => Comparison e -> MUArr e s -> Int -> Int -> ST s ()Source

Sorts the portion of an array delimited by [l,u)

sortByBounds' :: UA e => Comparison e -> MUArr e s -> Int -> Int -> Int -> ST s ()Source

Sorts the portion of the array delimited by [l,u) under the assumption that [l,m) is already sorted.

type Comparison e = e -> e -> Ordering Source

A type of comparisons between two values of a given type.