|
1 | 1 | # The Algorithms - Rust [](https://gitter.im/the-algorithms/rust) [](https://travis-ci.com/TheAlgorithms/Rust)
|
2 | 2 |
|
| 3 | +<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/d/d5/Rust_programming_language_black_logo.svg/1024px-Rust_programming_language_black_logo.svg.png" width="200" height="200"> |
| 4 | + |
| 5 | + |
| 6 | + |
3 | 7 | ### All algorithms implemented in Rust (for educational purposes)
|
4 | 8 |
|
5 | 9 | These are for demonstration purposes only.
|
6 | 10 |
|
7 | 11 | ## [Sort Algorithms](./src/sorting)
|
8 | 12 |
|
9 |
| -- [Bubble](./src/sorting/bubble_sort.rs) |
10 |
| -- [Counting](./src/sorting/counting_sort.rs) |
11 |
| -- [Heap](./src/sorting/heap_sort.rs) |
12 |
| -- [Insertion](./src/sorting/insertion_sort.rs) |
13 |
| -- [Merge](./src/sorting/merge_sort.rs) |
14 |
| -- [Quick](./src/sorting/quick_sort.rs) |
15 |
| -- [Radix](./src/sorting/radix_sort.rs) |
16 |
| -- [Selection](./src/sorting/selection_sort.rs) |
17 |
| -- [Shell](./src/sorting/shell_sort.rs) |
| 13 | +- [x] [Bubble](./src/sorting/bubble_sort.rs) |
| 14 | +- [x] [Counting](./src/sorting/counting_sort.rs) |
| 15 | +- [x] [Heap](./src/sorting/heap_sort.rs) |
| 16 | +- [x] [Insertion](./src/sorting/insertion_sort.rs) |
| 17 | +- [x] [Merge](./src/sorting/merge_sort.rs) |
| 18 | +- [x] [Quick](./src/sorting/quick_sort.rs) |
| 19 | +- [x] [Radix](./src/sorting/radix_sort.rs) |
| 20 | +- [x] [Selection](./src/sorting/selection_sort.rs) |
| 21 | +- [x] [Shell](./src/sorting/shell_sort.rs) |
18 | 22 |
|
19 | 23 | ## Graphs
|
20 | 24 |
|
21 |
| -- Dijkstra _(Not implemented yet)_ |
22 |
| -- Kruskal's Minimum Spanning Tree _(Not implemented yet)_ |
23 |
| -- Prim's Minimum Spanning Tree _(Not implemented yet)_ |
24 |
| -- BFS _(Not implemented yet)_ |
25 |
| -- DFS _(Not implemented yet)_ |
| 25 | +- [ ] Dijkstra |
| 26 | +- [ ] Kruskal's Minimum Spanning Tree |
| 27 | +- [ ] Prim's Minimum Spanning Tree |
| 28 | +- [ ] BFS |
| 29 | +- [ ] DFS |
26 | 30 |
|
27 | 31 | ## [Dynamic Programming](./src/dynamic_programming)
|
28 | 32 |
|
29 |
| -- [0-1 Knapsack](./src/dynamic_programming/knapsack.rs) |
30 |
| -- [Edit Distance](./src/dynamic_programming/edit_distance.rs) |
31 |
| -- [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs) |
32 |
| -- Longest increasing subsequence _(Not implemented yet)_ |
33 |
| -- [K-Means Clustering](./src/general/kmeans.rs) |
34 |
| -- Coin Change _(Not implemented yet)_ |
35 |
| -- Rod cut _(Not implemented yet)_ |
36 |
| -- [Egg Dropping Puzzle](./src/dynamic_programming/egg_dropping.rs) |
| 33 | +- [x] [0-1 Knapsack](./src/dynamic_programming/knapsack.rs) |
| 34 | +- [x] [Edit Distance](./src/dynamic_programming/edit_distance.rs) |
| 35 | +- [x] [Longest common subsequence](./src/dynamic_programming/longest_common_subsequence.rs) |
| 36 | +- [ ] Longest increasing subsequence |
| 37 | +- [x] [K-Means Clustering](./src/general/kmeans.rs) |
| 38 | +- [ ] Coin Change |
| 39 | +- [ ] Rod cut |
| 40 | +- [x] [Egg Dropping Puzzle](./src/dynamic_programming/egg_dropping.rs) |
37 | 41 |
|
38 |
| -## Data Structures |
| 42 | +## [Data Structures](./src/data_structures) |
39 | 43 |
|
40 |
| -- Queue _(Not implemented yet)_ |
41 |
| -- [Heap](./src/data_structures/heap.rs) |
42 |
| -- [Linked List](./src/data_structures/linked_list.rs) |
43 |
| -- Graph _(Not implemented yet)_ |
44 |
| - - Directed _(Not implemented yet)_ |
45 |
| - - Undirected _(Not implemented yet)_ |
46 |
| -- Trie _(Not implemented yet)_ |
47 |
| -- [Binary Search Tree](./src/data_structures/binary_search_tree.rs) |
48 |
| -- [B-Tree](./src/data_structures/b_tree.rs) |
49 |
| -- AVL Tree _(Not implemented yet)_ |
| 44 | +- Queue |
| 45 | +- [x] [Heap](./src/data_structures/heap.rs) |
| 46 | +- [x] [Linked List](./src/data_structures/linked_list.rs) |
| 47 | +- Graph |
| 48 | + - [ ] Directed |
| 49 | + - [ ] Undirected |
| 50 | +- [ ] Trie |
| 51 | +- [x] [Binary Search Tree](./src/data_structures/binary_search_tree.rs) |
| 52 | +- [x] [B-Tree](./src/data_structures/b_tree.rs) |
| 53 | +- [ ] AVL Tree |
50 | 54 |
|
51 |
| -## Strings |
| 55 | +## [Strings](./src/string) |
52 | 56 |
|
53 |
| -- [Knuth Morris Pratt](./src/string/knuth_morris_pratt.rs) |
54 |
| -- Rabin Carp _(Not implemented yet)_ |
| 57 | +- [x] [Knuth Morris Pratt](./src/string/knuth_morris_pratt.rs) |
| 58 | +- [ ] Rabin Carp |
55 | 59 |
|
56 |
| -## General |
| 60 | +## [General](./src/general) |
57 | 61 |
|
58 |
| -- [Convex Hull: Graham Scan](./src/general/convex_hull.rs) |
59 |
| -- N-Queensp _(Not implemented yet)_ |
60 |
| -- Graph Coloringp _(Not implemented yet)_ |
61 |
| -- [Tower of Hanoi](./src/general/hanoi.rs) |
| 62 | +- [x] [Convex Hull: Graham Scan](./src/general/convex_hull.rs) |
| 63 | +- [ ] N-Queensp |
| 64 | +- [ ] Graph Coloringp |
| 65 | +- [x] [Tower of Hanoi](./src/general/hanoi.rs) |
62 | 66 |
|
63 | 67 | ## [Search Algorithms](./src/searching)
|
64 | 68 |
|
65 |
| -- [Linear](./src/searching/linear_search.rs) |
66 |
| -- [Binary](./src/searching/binary_search.rs) |
| 69 | +- [x] [Linear](./src/searching/linear_search.rs) |
| 70 | +- [x] [Binary](./src/searching/binary_search.rs) |
67 | 71 |
|
68 | 72 | ## [Ciphers](./src/ciphers)
|
69 | 73 |
|
70 |
| -- [Caesar](./src/ciphers/caesar.rs) |
71 |
| -- [Vigenère](./src/ciphers/vigenere.rs) |
72 |
| -- Transposition _(Not implemented yet)_ |
| 74 | +- [x] [Caesar](./src/ciphers/caesar.rs) |
| 75 | +- [x] [Vigenère](./src/ciphers/vigenere.rs) |
| 76 | +- [ ] Transposition |
73 | 77 |
|
74 | 78 | ---
|
75 | 79 | ### Contributing
|
|
0 commit comments