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

pub fn quick_sort<T, F>(arr: &mut [T], compare: F)
where
    F: Fn(&T, &T) -> bool + Copy,
{
    if arr.len() <= 1 {
        return;
    }
    let pivot_index = partition(arr, compare);
    quick_sort(&mut arr[0..pivot_index], compare);
    quick_sort(&mut arr[pivot_index + 1..], compare);
}

fn partition<T, F>(arr: &mut [T], compare: F) -> usize
where
    F: Fn(&T, &T) -> bool,
{
    let pivot_index = arr.len() / 2;
    arr.swap(pivot_index, arr.len() - 1);
    let mut i = 0;
    for j in 0..arr.len() - 1 {
        if compare(&arr[j], &arr[arr.len() - 1]) {
            arr.swap(i, j);
            i += 1;
        }
    }
    arr.swap(i, arr.len() - 1);
    i
}