sort_library 0.1.1

A library for sorting algorithms 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

pub fn merge_sort<T, F>(arr: &mut [T], compare: &F)
where
    T: Clone + Default,
    F: Fn(&T, &T) -> bool,
{
    let len = arr.len();
    if len <= 1 {
        return;
    }

    let mid = len / 2;
    let mut left = Vec::with_capacity(mid);
    let mut right = Vec::with_capacity(len - mid);

    for i in 0..mid {
        left.push(arr[i].clone());
    }
    for i in mid..len {
        right.push(arr[i].clone());
    }

    merge_sort(&mut left, compare);
    merge_sort(&mut right, compare);

    merge(arr, &left, &right, compare);
}

fn merge<T, F>(arr: &mut [T], left: &[T], right: &[T], compare: &F)
where
    F: Fn(&T, &T) -> bool,
    T: Clone + Default,
{
    let mut i = 0;
    let mut j = 0;
    let mut k = 0;

    while i < left.len() && j < right.len() {
        if compare(&left[i], &right[j]) {
            arr[k] = left[i].clone();
            i += 1;
        } else {
            arr[k] = right[j].clone();
            j += 1;
        }
        k += 1;
    }

    while i < left.len() {
        arr[k] = left[i].clone();
        i += 1;
        k += 1;
    }

    while j < right.len() {
        arr[k] = right[j].clone();
        j += 1;
        k += 1;
    }
}