sorting 1.2.0

The world's best, finest and inefficient sorting algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

extern crate sorting;

use sorting::*;

#[test]
fn sorts_vectors() {
    let mut unsorted_vec = vec![1, 4, 6, 7, 9, 2, 3, 8, 5];

    unsorted_vec.slowsort();

    assert_eq!(unsorted_vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9]);
}