Modules index

# Sort

This module provides various sorting mechanisms.

`func sort(list, comparison := func (x, y) { return x < y }):` Sort `list` in place into the order determined by the `comparison` function using the quickest available sorting algorithm. Note that the sort is not guaranteed to be stable.

`func heapsort(list, comparison := func (x, y) { return x < y }):` Sort `list` in place into the order determined by the `comparison` function using the non-stable heapsort algorithm.

cvd_to_html ©2006-2007 Laurence Tratt