atrocious_sort 0.1.6

Some of the most useless sorting algorithms implemented in Rust.
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

//! Is a capitalist spy hiding in your data?

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

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

    #[test]
    fn case_2() {
        let mut data: Vec<i32> = vec![];
        stalinsort(&mut data);
        assert_eq!(data, []);
    }

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

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

/// Iterates over the vector and removes all elements that are out of order.
/// If an element in the vector is out of order it is most likely a filthy capitalist
/// saboteur keeping your honest and hard working data from being in order.
/// The given vector will be modified in place.
pub fn stalinsort<T: Ord>(arr: &mut Vec<T>) {
    if arr.is_empty() {
        return;
    }

    let mut length = arr.len() - 1;
    if length <= 1 {
        return;
    }

    let mut index = 1;
    while index <= length {
        if arr[index] < arr[index - 1] {
            arr.remove(index);
            length -= 1;
        }
        else {
            index += 1;
        }
    }
}