We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6bc0561 commit 68f6332Copy full SHA for 68f6332
std/sort.zig
@@ -2,6 +2,7 @@ const std = @import("index.zig");
2
const assert = std.debug.assert;
3
const mem = std.mem;
4
const math = std.math;
5
+const builtin = @import("builtin");
6
7
/// Stable in-place sort. O(n) best case, O(pow(n, 2)) worst case. O(1) memory (no allocator required).
8
pub fn insertionSort(comptime T: type, items: []T, lessThan: fn(lhs: &const T, rhs: &const T)->bool) {
0 commit comments