sorting_algorithm/
selection_sort.rs

1/// Sorts a data set using Selection Sort
2///
3/// Average time complexity: O(n<sup>2</sup>)
4///
5/// # Examples
6///
7/// ```
8/// use sorting_algorithm::selection_sort;
9///
10/// fn main() {
11///     let mut data = [3, 1, 2, 5, 4];
12///     
13///     selection_sort::sort(&mut data);
14///
15///     assert_eq!(data, [1, 2, 3, 4, 5]);
16/// }
17/// ```
18pub fn sort<T: Ord>(data: &mut [T]) {
19    if data.len() <= 1 {
20        return;
21    }
22
23    let n = data.len();
24
25    for i in 0..n {
26        let mut min_index = i;
27
28        for j in i + 1..n {
29            if data[j] < data[min_index] {
30                min_index = j;
31            }
32        }
33
34        data.swap(i, min_index);
35    }
36}