cogitate 0.2.0

Algorithms made 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
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

pub fn selection_sort<T: Ord>(arr: &mut [T]) {
  let length = arr.len();

  for i in 0..length {
    let mut min_index = i;

    for j in (i + 1)..length {
      if arr[j] < arr[min_index] {
        min_index = j;
      }
    }

    if min_index != i {
      arr.swap(i, min_index);
    }
  }
}

#[cfg(test)]
mod tests {
  use super::*;

  #[test]
  fn test_empty_array() {
    let mut arr: Vec<i32> = vec![];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![]);
  }

  #[test]
  fn test_single_element() {
    let mut arr = vec![1];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![1]);
  }

  #[test]
  fn test_sorted_array() {
    let mut arr = vec![1, 2, 3, 4, 5];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![1, 2, 3, 4, 5]);
  }

  #[test]
  fn test_reverse_sorted_array() {
    let mut arr = vec![5, 4, 3, 2, 1];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![1, 2, 3, 4, 5]);
  }

  #[test]
  fn test_unsorted_array() {
    let mut arr = vec![64, 25, 12, 22, 11];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![11, 12, 22, 25, 64]);
  }

  #[test]
  fn test_duplicates() {
    let mut arr = vec![3, 3, 2, 1, 1];
    selection_sort(&mut arr);
    assert_eq!(arr, vec![1, 1, 2, 3, 3]);
  }
}