Std::Sort

In-place sorting of integer arrays.

Module: Std::Sort

Sorts a contiguous array in ascending order, given a pointer to its first element and the element count. Each algorithm comes in an int form and a uint64 form.

import Std::Sort;
import Std::Io::PrintLine;

func Main() -> int {
    var nums: int[5] = { 5, 2, 8, 1, 9 };
    Sort::Sort(nums.data, nums.length);
    // nums is now { 1, 2, 5, 8, 9 }
    return 0;
}

WARNING

The int variants compare elements as unsigned 64-bit values. Negative numbers therefore sort after all non-negative numbers (as very large unsigned values), not before them. For correctly ordered signed data, offset your values into the non-negative range before sorting, or sort only non-negative data.

Functions

Function	Description
Sort	Adaptive sort — the default choice.
Quadsort	Stable merge-based sort.
Piposort	Memory-efficient merge sort variant.
Crumsort	In-place quicksort variant for large inputs.

Each has a *int form (shown above) and a *uint64 form (SortUint64, QuadsortUint64, …) for arrays already typed as uint64.