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

//! bubble sort algorithm

mod utils;

/**
Sort in ascending order using a bubble sort algorithm.

```
let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
bubble::sort(&mut nums);
assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
```
*/
pub fn sort<T>(arr: &mut [T])
where
    T: std::cmp::Ord,
{
    sort_by(arr, |l, r| l.cmp(r))
}

/** Sort in descending order using a bubble sort algorithm.

```
let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
bubble::sort_reverse(&mut nums);
assert_eq!(nums, [234, 111, 21, 13, 5, 4, 3, 2, 1]);
```
*/
pub fn sort_reverse<T>(arr: &mut [T])
where
    T: std::cmp::Ord,
{
    sort_by(arr, |l, r| l.cmp(r).reverse())
}

/**
It takes a comparator function to determine the order,
and sorts it using a bubble sort algorithm.

```
let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
bubble::sort_by(&mut nums, |l, r| l.cmp(r));
assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
```
*/
pub fn sort_by<T, F>(arr: &mut [T], compare: F)
where
    T: std::cmp::Ord,
    F: Fn(&T, &T) -> std::cmp::Ordering,
{
    let mut last = arr.len();

    while 0 != last {
        let mut i = 0;

        while (i + 1) < last {
            match compare(&arr[i], &arr[i + 1]) {
                std::cmp::Ordering::Less => (),
                std::cmp::Ordering::Greater => utils::swap(arr, i, i + 1),
                std::cmp::Ordering::Equal => (),
            }
            i += 1;
        }
        last -= 1;
    }
}