# SML/NJ Library Manual

## The `ArrayQSortFn` functor

#### Synopsis

> `functor `ArrayQSortFn` (MONO_ARRAY) : MONO_ARRAY_SORT
> `

The functor ArrayQSortFn implements functions for the in-place sorting of monomorphic arrays. The algorithm used is based on the a tuned version of quicksort due to J. Bentley and D. McIlroy described in ``Engineering a Sort Function,'' Software-Practice and Experience, 23(11), 1993, pp. 1249-1265.

The functor argument should be thinned to the minimum needed by the algorithm, which requires only an array type, plus the functions `sub`, `length` and `update`.

Not that the sorting algorithm is not stable.

#### See Also

> MONO_ARRAY, MONO_ARRAY_SORT, ARRAY_SORT

[ Top | Parent | Contents | Index | Root ]

Last Modified May 12, 1998
Comments to John Reppy
Copyright © 1998 Bell Labs, Lucent Technologies