rs_algo 0.1.3

Common sorting algorithms and other common computer science 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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

## Algo

A small crate of commonly used sorting algorithms for any generic type that implements PartialOrd and copy.

The crate can be found here: [Crate](https://crates.io/crates/rs_algo)

### Sorting
* merge sort
* quick sort
* insertion sort
* bubble sort

### LCS
* Find the longest common subsequence of two strings
* Find the longest common substring of two strings


## Usage
```rust
[dependencies]
rs_algo = "0.1"
```

## Example
```rust
use rs_algo::sort::*;
use rs_algo::compare::LCS;


fn main() {
  let mut a = vec![117, 1, 3, 99, 10, 7, 7, 2, 11, -5, 4, 9, 32, 1, 3, 99, 10, 7];
  let mut b = vec![117, 1, 3, 99, 10, 7, 7, 2, 11, -5, 4, 9, 817, 1, 3, 99, 10, 7];
  let mut c = vec![117, 1, 3, 99, 10, 7, 7, 2, 11, -5, 4, 9, 817, 1, 3, 99, 10, 7];
  let mut d = vec!["apple", "cake", "lemon", "zuccini", "berry", "black berry", "kit kat"];

  let time = merge::sort_with_time(&mut a);
  println!("merge sorted: time {:?}", time);

  let time = quick::sort_with_time(&mut b);
  println!("quick sorted: time {:?}", time);

  let time = insertion::sort_with_time(&mut c);
  println!("insertion sorted: time {:?}", time);

  let time = bubble::sort_with_time(&mut d);
  println!("bubble sorted: time {:?}", time);

  // get a new longest common sequence object
  let lcs = LCS::new_subsequence("leighxxxft".to_string(), "right".to_string());
  println!("lcs is = {}", lcs.subsequence_len);
  println!("longest common subsequence = {}", lcs.get_longest_subsequence().expect("no lcs found"));
}
```

## License
MIT