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
//! double selection sort algorithm.
//!
//! unstable sort
//! **O(N²)**
mod utils;
/// Sort in ascending order using a double selection sort algorithm.
///
/// ```rust
/// use buldak::double_selection;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// double_selection::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,
{
sort_by(array, |l, r| l.cmp(r))
}
/// Sort in descending order using a double selection sort algorithm.
///
/// ```rust
/// use buldak::double_selection;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// double_selection::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,
{
sort_by(array, |l, r| l.cmp(r).reverse())
}
/// It takes a comparator function to determine the order,
/// and sorts it using a double selection sort algorithm.
///
/// ```rust
/// use buldak::double_selection;
///
/// let mut nums = [1, 4, 2, 3, 5, 111, 234, 21, 13];
/// double_selection::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,
F: Fn(&T, &T) -> std::cmp::Ordering,
{
_double_selection_sort_impl(array, compare)
}
fn _double_selection_sort_impl<T, F>(array: &mut [T], compare: F)
where
T: std::cmp::Ord,
F: Fn(&T, &T) -> std::cmp::Ordering,
{
let mut first = 0;
let mut last = array.len() - 1;
while first <= last {
let mut min_i = first;
let mut max_i = first;
let mut i = first;
while i <= last {
match compare(&array[i], &array[max_i]) {
std::cmp::Ordering::Less => (),
std::cmp::Ordering::Greater => max_i = i,
std::cmp::Ordering::Equal => (),
}
match compare(&array[i], &array[min_i]) {
std::cmp::Ordering::Less => min_i = i,
std::cmp::Ordering::Greater => (),
std::cmp::Ordering::Equal => (),
}
i += 1;
}
if first == max_i {
max_i = min_i;
}
utils::swap(array, first, min_i);
utils::swap(array, last, max_i);
first += 1;
last -= 1;
}
}
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);
}
}
}