tadm 0.1.1

A collection of algorithms and data structures wrote out while reading The Algorithm Design Manual book
Documentation 
1
2
3
4
5
6
7
8
9
10

pub mod insertion_sort;

/// Sorter is a handy trait to allow multiple distinct implementations of the same sorting
/// mechanism.
pub trait Sorter<T>
where
    T: Ord,
{
    fn sort(&self, items: &mut [T]);
}