sorting_algorithm/gnome_sort.rs
1/// Sorts a data set using Gnome Sort
2///
3/// Average time complexity: O(n<sup>2</sup>)
4///
5/// # Examples
6///
7/// ```
8/// use sorting_algorithm::gnome_sort;
9///
10/// fn main() {
11/// let mut data = [3, 1, 2, 5, 4];
12///
13/// gnome_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 let mut i = 0;
26
27 while i < n {
28 if i == 0 {
29 i += 1;
30 }
31
32 if data[i] >= data[i - 1] {
33 i += 1;
34 } else {
35 data.swap(i, i - 1);
36 i -= 1;
37 }
38 }
39}