sort 0.8.5

sort algorithms
Documentation 
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
93
94
95
96
97
98
99
100
101
102
103
104

#[cfg(test)]
mod tests {
    use crate::quicksort;

    #[test]
    fn sort_1() {
        let mut data = vec![5, 4, 3, 2, 1];
        quicksort(&mut data);
        assert_eq!(data, [1, 2, 3, 4, 5]);
    }

    #[test]
    fn sort_2() {
        let mut data = vec![1, 1];
        quicksort(&mut data);
        assert_eq!(data, [1, 1]);
    }

    #[test]
    fn sort_3() {
        let mut data = vec![1, 2, 2, 2, 1];
        quicksort(&mut data);
        assert_eq!(data, [1, 1, 2, 2, 2]);
    }
}

pub fn _exchange<T: PartialOrd>(vec: &mut [T], pivot: &T) -> (usize, usize) {
    let length = vec.len();
    let mut left_idx = 0;
    let mut right_idx = length - 1;
    loop {
        while left_idx < length && vec[left_idx] <= *pivot {
            left_idx += 1;
        }
        while vec[right_idx] > *pivot {
            right_idx -= 1;
        }
        if left_idx >= right_idx {
            break;
        }
        vec.swap(left_idx, right_idx);
        left_idx += 1;
        right_idx -= 1;
    }
    (left_idx, right_idx + 1)
}

pub fn _move_pivots<T: PartialOrd>(
    vec: &mut [T],
    pivot: &T,
    mut pivot_idx: usize,
) -> (usize, usize) {
    let mut left_idx = 0;
    pivot_idx -= 1;
    loop {
        while pivot_idx > 0 && vec[pivot_idx] == *pivot {
            pivot_idx -= 1;
        }
        while vec[left_idx] != *pivot {
            left_idx += 1;
        }
        if left_idx >= pivot_idx {
            break;
        }
        vec.swap(left_idx, pivot_idx);
        left_idx += 1;
        pivot_idx -= 1;
    }
    (left_idx, pivot_idx)
}

pub fn _pivot<T: PartialOrd + Clone>(v: &mut [T]) -> T {
    let l = v.len();
    let m = l / 2;
    if v[0] > v[m] {
        v.swap(0, m);
    }
    if v[m] > v[l - 1] {
        v.swap(m, l - 1);
    }
    if v[0] > v[m] {
        v.swap(0, m);
    }
    v[m].clone()
}

pub fn quicksort<T: PartialOrd + Clone>(v: &mut [T]) {
    let l = v.len();

    if l < 2 {
        return;
    }

    let pivot = _pivot(v);

    if l < 4 {
        return;
    }

    let (pivot_idx, right_idx) = _exchange(v, &pivot);
    let (left_idx, _) = _move_pivots(v, &pivot, pivot_idx);
    quicksort(&mut v[right_idx..]);
    quicksort(&mut v[..left_idx]);
}