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

use crate::exchange_sorts::quicksort;
use crate::heapsort;
use crate::insertion_sort;

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

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

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

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

fn _introsort<T: PartialOrd + Clone>(v: &mut [T], depth: usize) {
    let l = v.len();

    if l <= 16 {
        insertion_sort(v);
        return;
    }

    if depth == 0 {
        heapsort(v);
        return;
    }

    let pivot = quicksort::_pivot(v);
    let (pivot_idx, right_idx) = quicksort::_exchange(v, &pivot);
    let (left_idx, _) = quicksort::_move_pivots(v, &pivot, pivot_idx);
    _introsort(&mut v[right_idx..], depth - 1);
    _introsort(&mut v[..left_idx], depth - 1);
}

pub fn introsort<T: PartialOrd + Clone>(v: &mut [T]) {
    let max_depth = ((v.len() as f64).log2() * 2.) as usize;
    _introsort(v, max_depth)
}