buldak 0.28.1

It is a library that provides various sorting functions.
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175

//! shell sort algorithm.
//!
//! unstable sort  
//! **O(N²)**

/// Sort in ascending order using a shell sort algorithm.
///
/// ```rust
/// use buldak::shell;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// shell::sort(&mut nums);
/// assert_eq!(nums, [1, 2, 3, 4, 5, 13, 21, 111, 234]);
/// ```
pub fn sort<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r))
}

/// Sort in descending order using a shell sort algorithm.
///
/// ```rust
/// use buldak::shell;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// shell::sort_reverse(&mut nums);
/// assert_eq!(nums, [234, 111, 21, 13, 5, 4, 3, 2, 1]);
/// ```
pub fn sort_reverse<T>(array: &mut [T])
where
    T: std::cmp::Ord + std::clone::Clone,
{
    sort_by(array, |l, r| l.cmp(r).reverse())
}

/// It takes a comparator function to determine the order,
/// and sorts it using a shell sort algorithm.
///
/// ```rust
/// use buldak::shell;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// shell::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>(array: &mut [T], compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
    _shell_sort_impl(array, compare);
}

fn _shell_sort_impl<T, F>(array: &mut [T], compare: F)
where
    T: std::cmp::Ord + std::clone::Clone,
    F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
{
    let mut gap = 1;

    while gap < array.len() {
        gap = gap * 3 + 1;
    }
    gap /= 3;

    while gap > 0 {
        for i in gap..array.len() {
            let mut k = (i - gap) as isize;
            let key = array[i].clone();
            while k >= 0 && compare(&key, &array[k as usize]) == std::cmp::Ordering::Less {
                array[k as usize + gap] = array[k as usize].clone();
                k -= gap as isize;
            }
            array[(k + gap as isize) as usize] = key;
        }

        gap /= 3;
    }

    // while gap > 0 {
    //     for i in gap..array.len() {
    //         let mut j = i - gap;

    //         let key = array[i].clone();

    //         while j>=0 && compare(&key, &array[j]) == std::cmp::Ordering::Less {
    //             array[j+gap] = array[j].clone();

    //             if j<gap {
    //                 break;
    //             }
    //             j-=gap;
    //         }
    //         array[j+gap] = key;
    //     }

    //     gap = gap/3+1;
    // }

    // let mut gap = array.len()/3 + 1;

    // while gap > 0 {
    //     for i in 0..gap {
    //         _shell_sort_insertion_impl(array, i, array.len()-1, gap, compare.clone());
    //     }

    //     gap = (gap/3) + 1;
    // }
}

// fn _shell_sort_insertion_impl<T, F>(array: &mut [T], first: usize, last: usize, gap: usize, compare: F)
// where
//     T: std::cmp::Ord + std::clone::Clone,
//     F: Fn(&T, &T) -> std::cmp::Ordering + std::clone::Clone,
// {
//     let mut i = first+gap;
//     while i<=last {
//         let key = array[i].clone();

//         let mut j = i-gap;
//         while j>=first && compare(&array[j], &key) == std::cmp::Ordering::Greater {
//             array[j + gap] = array[j].clone();

//             if j >= gap {
//                 j -= gap;
//             }
//         }

//         array[j+gap] = key.clone();

//         i += gap;
//     }
// }

mod tests {
    #[test]
    fn sort_ascending() {
        struct TestCase {
            input: Vec<i32>,
            expected: Vec<i32>,
        }

        let test_cases = vec![TestCase {
            input: vec![1, 4, 2, 3, 5, 111, 234, 21, 13],
            expected: vec![1, 2, 3, 4, 5, 13, 21, 111, 234],
        }];

        for case in test_cases {
            let mut actual = case.input.clone();
            super::sort(&mut actual);
            assert_eq!(actual, case.expected);
        }
    }

    #[test]
    fn sort_descending() {
        struct TestCase {
            input: Vec<i32>,
            expected: Vec<i32>,
        }

        let test_cases = vec![TestCase {
            input: vec![1, 4, 2, 3, 5, 111, 234, 21, 13],
            expected: vec![234, 111, 21, 13, 5, 4, 3, 2, 1],
        }];

        for case in test_cases {
            let mut actual = case.input.clone();
            super::sort_reverse(&mut actual);
            assert_eq!(actual, case.expected);
        }
    }
}