algorithm_rust 0.6.0

some common rust_algorithms, Everyone can participate, and the project will continue to be updated, all the algorithms comes from <Introduction to Algorithms III>
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


fn counting_sort(arr: &mut [usize], exp: usize) {
    let n = arr.len();
    let mut output = vec![0; n];
    let mut count = vec![0; 10];

    for &num in arr.iter() {
        count[(num / exp) % 10] += 1;
    }

    for i in 1..10 {
        count[i] += count[i - 1];
    }

    let mut i = n as i32 - 1;
    while i >= 0 {
        let num = arr[i as usize];
        output[count[(num / exp) % 10] - 1] = num;
        count[(num / exp) % 10] -= 1;
        i -= 1;
    }

    for i in 0..n {
        arr[i] = output[i];
    }
}

///基数排序
///Θ(d(n+k))
/// # Examples
///
/// ```
/// use algori::sort::radix_sort;
///
/// let mut a = [7, 3, 5, 1, 9, 65, 65, 4, 6];
/// radix_sort(&mut a);
/// assert_eq!(a, [1, 3, 4, 5, 6, 7, 9, 65, 65]);
/// ```
pub fn radix_sort(arr: &mut [usize]) {
    let max = *arr.iter().max().unwrap_or(&0);
    let mut exp = 1;
    while max / exp > 0 {
        counting_sort(arr, exp);
        exp *= 10;
    }
}