selection_sort 1.1.0

Selection sort algorithm
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

use std::vec::Vec;

/// Executes Selection Sort
///
/// # Examples
///
/// ```
/// use selection_sort::selection_sort;
///
/// fn main () {
///   let mut vec = vec![1, 3, 2];
///   selection_sort(&mut vec);
///   println!("{:?}", vec);
///   assert!(vec == [1, 2, 3]);
/// }
/// // [1,2,3]
/// ```
pub fn selection_sort<T: PartialOrd>(vec: &mut Vec<T>) {
    let mut j_min;
    let len = vec.len();
    if len == 0 {
        return;
    }
    for i in 0..len - 1 {
        j_min = i;
        for j in i + 1..len {
            if j >= len {
                break;
            };
            if vec[j] < vec[j_min] {
                j_min = j;
            }
        }
        if j_min != i {
            vec.swap(i, j_min);
        }
    }
}

mod tests {
    #[cfg(test)]
    use super::*;
    use quickcheck::quickcheck;
    quickcheck! {
        fn known_sort_test(vec: Vec<u32>) -> bool {
          let mut a = vec.clone();
          let mut b = vec.clone();
          selection_sort (&mut a);
          b.sort();
          return a == b;
        }
    }
    #[cfg(test)]
    quickcheck! {
      fn idempotency(vec: Vec<u32>) -> bool {
        let mut a = vec.clone();
        let mut b = vec.clone();
        selection_sort (&mut a);
        selection_sort (&mut a);
        selection_sort (&mut b);
        return a == b;
      }
    }
}