Yet another implementation of all the basic CS algorithms, but now in Rust.
In order to build the binaries just cd
into the folder and run ~$ cargo build
.
After that run each desired example with cargo run --bin BINARY_NAME
.
You can also run the binaries from the target folder itself. E.g. ./target/release/list
Progress | Name |
---|---|
BASICS | |
✔️ | Fibonacci + Recursive |
✔️ | Fibonacci iterator |
✔️ | Euclid's GCD + Recursive |
✔️ | Linked list |
✔️ | BST |
⏳ | Doubly linked list |
CELLULAR AUTOMATA | |
✔️ | Game of Life |
SORTING | |
✔️ | bubble sort |
✔️ | quick sort |
✔️ | quick sort with Templates and Closures |
✔️ | insertion sort |
✔️ | merge sort |
✔️ | counting sort |
⏳ | tim sort |
⏳ | radix sort |