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
87
88
89
90
91
92
use crate::vector::FocusMut;
use std::cmp::Ordering;
pub fn quicksort<A, F>(vector: &mut FocusMut<A>, left: usize, right: usize, cmp: &F)
where
A: Clone,
F: Fn(&A, &A) -> Ordering,
{
if right <= left {
return;
}
let l = left as isize;
let r = right as isize;
let mut l1 = l;
let mut r1 = r;
let mut l2 = l - 1;
let mut r2 = r;
loop {
while l1 != r && vector.pair(l1 as usize, r as usize, |a, b| cmp(a, b)) == Ordering::Less {
l1 += 1;
}
r1 -= 1;
while r1 != r && vector.pair(r as usize, r1 as usize, |a, b| cmp(a, b)) == Ordering::Less {
if r1 == l {
break;
}
r1 -= 1;
}
if l1 >= r1 {
break;
}
vector.swap(l1 as usize, r1 as usize);
if l1 != r && vector.pair(l1 as usize, r as usize, |a, b| cmp(a, b)) == Ordering::Equal {
l2 += 1;
vector.swap(l2 as usize, l1 as usize);
}
if r1 != r && vector.pair(r as usize, r1 as usize, |a, b| cmp(a, b)) == Ordering::Equal {
r2 -= 1;
vector.swap(r1 as usize, r2 as usize);
}
}
vector.swap(l1 as usize, r as usize);
r1 = l1 - 1;
l1 += 1;
let mut k = l;
while k < l2 {
vector.swap(k as usize, r1 as usize);
r1 -= 1;
k += 1;
}
k = r - 1;
while k > r2 {
vector.swap(l1 as usize, k as usize);
k -= 1;
l1 += 1;
}
if r1 >= 0 {
quicksort(vector, left, r1 as usize, cmp);
}
quicksort(vector, l1 as usize, right, cmp);
}
#[cfg(test)]
mod test {
use super::*;
use crate::test::is_sorted;
use crate::vector::proptest::vector;
use ::proptest::num::i32;
use ::proptest::proptest;
proptest! {
#[test]
fn test_quicksort(ref input in vector(i32::ANY, 0..1000)) {
let mut vec = input.clone();
let len = vec.len();
if len > 1 {
quicksort(&mut vec.focus_mut(), 0, len - 1, &Ord::cmp);
}
assert!(is_sorted(vec));
}
}
}