This repo contains the implementation of various classic algorithms for educational purposes in Rust. Right now, it is in its early stages, but the plan is to include a comprehensive list of algorithms. Contributions are welcome!
The main goal right now is to match the current algorithms implemented in https://github.com/TheAlgorithms/Rust.
- Bubble
- Counting
- Heap
- Insertion
- Merge
- Quick
- Radix
- Selection
- Shell
- Dijkstra
- Kruskal's Minimum Spanning Tree
- Prim's Minimum Spanning Tree
- BFS
- DFS
- 0-1 Knapsack
- Edit Distance
- Longest common subsequence
- Longest increasing subsequence
- K-Means Clustering
- Coin Change
- Rod cutting
- Egg Dropping Puzzle
- Queue
- Heap
- Linked List
- Graph
- Trie
- Binary Search Tree
- B-Tree
- AVL Tree
- Knuth Morris Pratt
- Rabin Carp
- Convex Hull: Graham Scan
- N-Queens
- Graph Coloring
- Tower of Hanoi
- Transposition
See CONTRIBUTING.md