The Algorithms - Rust 
All algorithms implemented in Rust (for educational purposes)
These are for demonstration purposes only.
Sort Algorithms
- Bubble
- Counting
- Heap
- Insertion
- Merge (Not implemented yet)
- Quick
- Radix (Not implemented yet)
- Selection
- Shell
Graphs
- Dijkstra (Not implemented yet)
- Kruskal's Minimum Spanning Tree (Not implemented yet)
- Prim's Minimum Spanning Tree (Not implemented yet)
- BFS (Not implemented yet)
- DFS (Not implemented yet)
Dynamic Programming
- 0-1 Knapsack (Not implemented yet)
- Longest common subsequence (Not implemented yet)
- Longest increasing subsequence (Not implemented yet)
- K-Means Clustering
- Coin Change (Not implemented yet)
- Rod cut (Not implemented yet)
- Egg Dropping Puzzle (Not implemented yet)
Data Structures
- Queue (Not implemented yet)
- Heap (Not implemented yet)
- Linked List (Not implemented yet)
- Graph (Not implemented yet)
- Directed (Not implemented yet)
- Undirected (Not implemented yet)
- Trie (Not implemented yet)
- Binary Tree (Not implemented yet)
- B-Tree (Not implemented yet)
- AVL Tree (Not implemented yet)
Strings
- Knuth Morris Pratt (Not implemented yet)
- Rabin Carp (Not implemented yet)
General
- N-Queensp (Not implemented yet)
- Graph Coloringp (Not implemented yet)
- Tower of Hanoip (Not implemented yet)
Search Algorithms
Ciphers
- Caesar
- Vigenère (Not implemented yet)
- Transposition (Not implemented yet)
Contributing
See CONTRIBUTING.md