Rust
·225 words·2 mins
The Algorithms - Rust #
All algorithms implemented in Rust #
These are for demonstration purposes only.
Sort Algorithms #
- Bubble
- Bucket
- Cocktail-Shaker
- Counting
- Heap
- Insertion
- Gnome
- Merge
- Odd-even
- Pancake
- Quick
- Radix
- Selection
- Shell
- Stooge
- Comb
- Bucket
- Timsort
Graphs #
- Dijkstra
- Kruskal’s Minimum Spanning Tree
- Prim’s Minimum Spanning Tree
- Breadth-First Search (BFS)
- Depth First Search (DFS)
- Bellman-Ford
- Prufer Code
Math #
- Extended euclidean algorithm
- Greatest common divisor
- Miller Rabin primality test
- Pascal’s triangle
- Square root with Newton’s method
- Fast power algorithm
- Perfect number
- Prime number
- Linear Sieve
- Pollard’s Rho algorithm
- Fast Fourier Transform
Dynamic Programming #
- 0-1 Knapsack
- Edit Distance
- Longest common subsequence
- Longest continuous increasing subsequence
- Longest increasing subsequence
- K-Means Clustering
- Coin Change
- Rod Cutting
- Egg Dropping Puzzle
- Maximum Subarray
- Is Subsequence
- Maximal Square
Data Structures #
- Queue
- Heap
- Linked List
- Graph
- Trie
- Binary Search Tree
- B-Tree
- AVL Tree
- RB Tree
- Stack using Linked List
- Segment Tree
Strings #
- Aho-Corasick Algorithm
- Burrows-Wheeler transform
- Knuth Morris Pratt
- Manacher
- Rabin Carp
- Reverse
- Hamming Distance
General #
- Convex Hull: Graham Scan
- N-Queens Problem
- Graph Coloringp
- Tower of Hanoi
- Kmeans
- Two Sum
Search Algorithms #
Geometry #
Ciphers #
All implemented Algos #
See DIRECTORY.md
Contributing #
See CONTRIBUTING.md