vector-algorithms

Efficient algorithms for vector arrays

Version0.9.1.0
CategoryData
LicenceBSD-3-Clause
AuthorDan Doel
MaintainerDan Doel <dan.doel@gmail.com> Erik de Castro Lopo <erikd@mega-nerd.com>
Homepagegithub.com/erikd/vector-algorithms
Pinned byhackage vector-algorithms 0.9.1.0
Sourcehackage.haskell.org/package/vector-algorithms-0.9.1.0

Modules

Data.Vector.Algorithms
Data.Vector.Algorithms.AmericanFlagThis module implements American flag sort: an in-place, unstable, bucket
Data.Vector.Algorithms.HeapThis module implements operations for working with a quaternary heap stored
Data.Vector.Algorithms.InsertionA simple insertion sort. Though it's O(n^2), its iterative nature can be
Data.Vector.Algorithms.IntroThis module implements various algorithms based on the introsort algorithm,
Data.Vector.Algorithms.MergeThis module implements a simple top-down merge sort. The temporary buffer
Data.Vector.Algorithms.OptimalOptimal sorts for very small array sizes, or for small numbers of
Data.Vector.Algorithms.RadixThis module provides a radix sort for a subclass of unboxed arrays. The
Data.Vector.Algorithms.SearchThis module implements several methods of searching for indicies to insert
Data.Vector.Algorithms.TimTimsort is a complex, adaptive, bottom-up merge sort. It is designed to

Efficient algorithms for sorting vector arrays. At some stage other vector algorithms may be added.

5 packages