algods 0.1.0

A collection of data structures and 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
33
34
35

use algods::{
    sort::{BinaryHeapSort, InsertionSort},
    utils::Point,
};

fn main() {
    let mut vec: Vec<isize> = vec![-1, -10, 15, 16, -18];
    let insertion = InsertionSort::<isize>::init(vec.clone());

    // sort using the insertion sort algorithm
    let insertion_sorted_vec = insertion.into_sorted_vec();
    println!("{:?}", insertion_sorted_vec);
    // sort using the standard library vec sort
    vec.sort();

    assert_eq!(insertion_sorted_vec, vec);

    // You can sort objects whose type is at least Clone and Ord
    // For example points in ZxZ implementing an Ord such that
    // points whith higher ordinates are larger, and two points
    // with the same ordinate will be ordered according to their
    // abscissa: (-1,0) < (0,0) < (-1, 1)

    let origin = Point::<isize>::init(0, 0);
    let point_beyond_origin = Point::<isize>::init(-1, 1);
    let point_below_origin = Point::<isize>::init(-1, 0);
    let mut points = vec![origin, point_beyond_origin, point_below_origin];

    let heap = BinaryHeapSort::<Point<isize>>::init(points.clone());
    let heap_sorted_vec = heap.into_sorted_vec();
    println!("{:?}", heap_sorted_vec);
    points.sort();

    assert_eq!(heap_sorted_vec, points);
}