Skip to content

insertionSort ​

insertionSort(values) returns an ascending copy by inserting each value into the already sorted prefix. It is useful for small or nearly sorted arrays.

SignatureReturnsComplexity
insertionSort(values: i32[])i32[]O(n²) worst case, O(n) best case
tyrus
import { insertionSort } from "tyrus:algorithm";
const sorted: i32[] = insertionSort([3, 1, 2]);
print(sorted[0], sorted[2]);  // 1 3

Study result ​

ExportTypePurpose
insertionSortInfo(values: 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, insertionSortInfo } from "tyrus:algorithm";

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

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