Skip to content

countingSort ​

countingSort(values, maxValue) returns an ascending copy of non-negative integers in the inclusive range 0..maxValue. Values outside that range are returned unchanged.

SignatureReturnsComplexity
countingSort(values: i32[], maxValue: i32)i32[]O(n + maxValue) time and memory
tyrus
import { countingSort } from "tyrus:algorithm";
const sorted: i32[] = countingSort([3, 1, 2, 1], 3);
print(sorted[0], sorted[3]);  // 1 3

Study result ​

ExportTypePurpose
countingSortInfo(values: i32[], maxValue: i32)FunctionReturns an independent SortInfo snapshot and operation metrics
SortInfoData interfaceHolds the original and sorted arrays, comparison count, and swap count

SortInfo exposes originalValues, sortedValues, comparisonCount, and swapCount. Non-comparison sorts report zero comparisons and zero swaps because they do not compare values or exchange array elements. The input array is unchanged.

Interface example ​

tyrus
interface SortInfo {
    originalValues: i32[];
    sortedValues: i32[];
    comparisonCount: usize;
    swapCount: usize;
}

Usage example ​

tyrus
import { SortInfo, countingSortInfo } from "tyrus:algorithm";

const input: i32[] = [8, 3, 5, 1];
const info: SortInfo = countingSortInfo(input, 9);

print(info.originalValues); // [8, 3, 5, 1]
print(info.sortedValues); // [1, 3, 5, 8]
print(info.comparisonCount); // 0
print(info.swapCount); // 0