sorting-algorithm 0.1.16

An implementation of various sorting algorithms
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

/// Sorts a data set using Exchange Sort
///
/// Average time complexity: O(n<sup>2</sup>)
///
/// # Example
///
/// ```
/// use sorting_algorithm::exchange_sort;
///
/// fn main() {
///     let mut data = [3, 1, 2, 5, 4];
///     
///     exchange_sort::sort(&mut data);
///
///     assert_eq!(data, [1, 2, 3, 4, 5]);
/// }
/// ```
pub fn sort<T: Ord>(data: &mut [T]) {
    if data.len() <= 1 {
        return;
    }

    let n = data.len();

    for i in 0..(n-1) {
        for j in (i+1)..n {
            if data[i] > data[j] {
                data.swap(i, j);
            }
        }
    }
}