sorting-algorithm 0.1.17

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

use fastrand;

/// Sorts a data set using Bogo Sort
///
/// Average time complexity: O(n*n!)
///
/// # Example
///
/// ```
/// use sorting_algorithm::bogo_sort;
///
/// fn main() {
///     let mut data = [3, 1, 2, 5, 4];
///     
///     bogo_sort::sort(&mut data);
///
///     assert_eq!(data, [1, 2, 3, 4, 5]);
/// }
/// ```
pub fn sort<T: Ord>(data: &mut [T]) {
    while !data.is_sorted() {
        fastrand::shuffle(data);
    }
}