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
use rand::prelude::*;
pub fn sort<T: PartialOrd>(input: &mut [T]) {
if input.is_empty() {
return;
}
let mut rng = rand::thread_rng();
while !is_sorted(input) {
input.shuffle(&mut rng);
}
}
fn is_sorted<T: PartialOrd>(input: &[T]) -> bool {
for i in 0..input.len() - 1 {
if input[i] > input[i + 1] {
return false;
}
}
true
}
#[test]
fn small_random() {
let mut test = vec![4, 2, 1, 5, 3];
let oracle = vec![1, 2, 3, 4, 5];
sort(&mut test);
assert_eq!(oracle, test);
}
#[test]
fn small_same() {
let mut test = vec![0;5];
let oracle = vec![0;5];
sort(&mut test);
assert_eq!(oracle, test);
}
#[test]
fn empty() {
let mut test: Vec<i32> = Vec::new();
let oracle: Vec<i32> = Vec::new();
sort(&mut test);
assert_eq!(oracle, test);
}
#[test]
fn small_sorted() {
let mut test = vec![1, 2, 3, 4, 5];
let oracle = vec![1, 2, 3, 4, 5];
sort(&mut test);
assert_eq!(oracle, test);
}