The Algorithms - Rust

All algorithms implemented in Rust (for educational purposes)

These are for demonstration purposes only. RESTART BUILD

Sort Algorithms

• Bubble
• Cocktail-Shaker
• Counting
• Heap
• Insertion
• Merge
• Odd-even
• Quick
• Radix
• Selection
• Shell
• Stooge
• Comb

Graphs

• Dijkstra
• Kruskal's Minimum Spanning Tree
• Prim's Minimum Spanning Tree
• BFS
• DFS
• Bellman-Ford

Math

• Extended euclidean algorithm

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

Data Structures

• Queue
• Heap
• Linked List
• Graph
  • Directed
  • Undirected
• Trie
• Binary Search Tree
• B-Tree
• AVL Tree

Strings

• Burrows-Wheeler transform
• Knuth Morris Pratt
• Manacher
• Rabin Carp
• Reverse

General

• Convex Hull: Graham Scan
• N-Queensp
• Graph Coloringp
• Tower of Hanoi
• Kmeans

Search Algorithms

• Linear
• Binary
• Recursive Binary

Geometry

• Closest pair of 2D points

Ciphers

• Caesar
• Vigenère
• Morse Code
• XOR
• Rot13
  • Rot13
  • Another Rot13
• Transposition
• SHA-2

---

All implemented Algos

See DIRECTORY.md

Contributing

See CONTRIBUTING.md