Function sort [src]

Sorts a slice in-place using a stable algorithm (maintains relative order of equal elements). Average time complexity: O(n log n), worst case: O(n log n) Space complexity: O(log n) for recursive calls For slice of primitives with default ordering, consider using std.sort.block directly. For unstable but potentially faster sorting, see sortUnstable.

Prototype

 pub fn sort( comptime T: type, items: []T, context: anytype, comptime lessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool, ) void

Parameters

T: typeitems: []TlessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool

Source

  pub fn sort(
    comptime T: type,
    items: []T,
    context: anytype,
    comptime lessThanFn: fn (@TypeOf(context), lhs: T, rhs: T) bool,
) void {
    std.sort.block(T, items, context, lessThanFn);
}  