-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathquicksort.zig
86 lines (76 loc) · 2.09 KB
/
quicksort.zig
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
const std = @import("std");
const builtin = std.builtin;
const expect = std.testing.expect;
const mem = std.mem;
///References: https://en.wikipedia.org/wiki/Quicksort
pub fn sort(A: []i32, lo: usize, hi: usize) void {
if (lo < hi) {
var p = partition(A, lo, hi);
sort(A, lo, @min(p, p -% 1));
sort(A, p + 1, hi);
}
}
pub fn partition(A: []i32, lo: usize, hi: usize) usize {
//Pivot can be chosen otherwise, for example try picking the first or random
//and check in which way that affects the performance of the sorting
var pivot = A[hi];
var i = lo;
var j = lo;
while (j < hi) : (j += 1) {
if (A[j] < pivot) {
mem.swap(i32, &A[i], &A[j]);
i = i + 1;
}
}
mem.swap(i32, &A[i], &A[hi]);
return i;
}
pub fn main() !void {}
test "empty array" {
var array: []i32 = &.{};
sort(array, 0, 0);
const a = array.len;
try expect(a == 0);
}
test "array with one element" {
var array: [1]i32 = .{5};
sort(&array, 0, array.len - 1);
const a = array.len;
try expect(a == 1);
try expect(array[0] == 5);
}
test "sorted array" {
var array: [10]i32 = .{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
sort(&array, 0, array.len - 1);
for (array, 0..) |value, i| {
try expect(value == (i + 1));
}
}
test "reverse order" {
var array: [10]i32 = .{ 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
sort(&array, 0, array.len - 1);
for (array, 0..) |value, i| {
try expect(value == (i + 1));
}
}
test "unsorted array" {
var array: [5]i32 = .{ 5, 3, 4, 1, 2 };
sort(&array, 0, array.len - 1);
for (array, 0..) |value, i| {
try expect(value == (i + 1));
}
}
test "two last unordered" {
var array: [10]i32 = .{ 1, 2, 3, 4, 5, 6, 7, 8, 10, 9 };
sort(&array, 0, array.len - 1);
for (array, 0..) |value, i| {
try expect(value == (i + 1));
}
}
test "two first unordered" {
var array: [10]i32 = .{ 2, 1, 3, 4, 5, 6, 7, 8, 9, 10 };
sort(&array, 0, array.len - 1);
for (array, 0..) |value, i| {
try expect(value == (i + 1));
}
}