| ... | ... | @@ -7,16 +7,14 @@ const builtin = @import("builtin"); |
| 7 | 7 | |
| 8 | 8 | /// Stable in-place sort. O(n) best case, O(pow(n, 2)) worst case. O(1) memory (no allocator required). |
| 9 | 9 | pub fn insertionSort(comptime T: type, items: []T, lessThan: fn (lhs: T, rhs: T) bool) void { |
| 10 | | { |
| 11 | | var i: usize = 1; |
| 12 | | while (i < items.len) : (i += 1) { |
| 13 | | const x = items[i]; |
| 14 | | var j: usize = i; |
| 15 | | while (j > 0 and lessThan(x, items[j - 1])) : (j -= 1) { |
| 16 | | items[j] = items[j - 1]; |
| 17 | | } |
| 18 | | items[j] = x; |
| 10 | var i: usize = 1; |
| 11 | while (i < items.len) : (i += 1) { |
| 12 | const x = items[i]; |
| 13 | var j: usize = i; |
| 14 | while (j > 0 and lessThan(x, items[j - 1])) : (j -= 1) { |
| 15 | items[j] = items[j - 1]; |
| 19 | 16 | } |
| 17 | items[j] = x; |
| 20 | 18 | } |
| 21 | 19 | } |
| 22 | 20 | |