The Algorithms - Rust

All algorithms implemented in Rust

These are for demonstration purposes only.

Sort Algorithms

• Bubble
• Bucket
• Cocktail-Shaker
• Counting
• Cycle
• Exchange
• Heap
• Insertion
• Gnome
• Merge
• Odd-even
• Pancake
• Pigeonhole
• Quick
• Radix
• Selection
• Shell
• Stooge
• Comb
• Bucket
• Timsort
• Sleep

Graphs

• Dijkstra
• Kruskal's Minimum Spanning Tree
• Prim's Minimum Spanning Tree
• Breadth-First Search (BFS)
• Depth First Search (DFS)
• Bellman-Ford
• Prufer Code
• Lowest Common Ancestor
• Heavy Light Decomposition
• Tarjan's Strongly Connected Components
• Topological sorting
• Centroid Decomposition
• Dinic's Max Flow
• 2-SAT Problem
• Floyd-Warshall

Math

• Amicable numbers below N
• Baby-Step Giant-Step Algorithm
• Ceil
• Chinese Remainder Theorem
• Extended euclidean algorithm
• Fast Inverse Square Root 'Quake' Algorithm
• Gaussian Elimination
• Greatest common divisor
• Greatest common divisor of n numbers
• Least common multiple of n numbers
• Miller Rabin primality test
• Pascal's triangle
• Square root with Newton's method
• Fast power algorithm
• Perfect number
• Prime factors
• Prime number
• Linear Sieve
• Pollard's Rho algorithm
• Quadratic Residue
• Simpson's Rule for Integration
• Fast Fourier Transform
• Armstrong Number
• Permuted Congruential Random Number Generator
• Zeller's Congruence Algorithm
• Karatsuba Multiplication Algorithm
• Financial Interest

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
  • Directed
  • Undirected
• Trie
• Binary Search Tree
• B-Tree
• AVL Tree
• RB Tree
• Stack using Linked List
• Segment Tree
• Fenwick Tree
• Union-find

Strings

• Aho-Corasick Algorithm
• Boyer-Moore String Search Algorithm
• Burrows-Wheeler transform
• Duval Algorithm
• Knuth Morris Pratt
• Levenshtein Distance
• Manacher
• Rabin Carp
• Reverse
• Run Length Encoding
• Hamming Distance
• Jaro-Winkler Distance
• Suffix Tree
• Suffix Array
• Autocomplete using Trie

General

• Convex Hull: Graham Scan
• N-Queens Problem
• Graph Coloring
• Tower of Hanoi
• Kmeans
• Two Sum
• Huffman Encoding

Search Algorithms

• Linear
• Binary
• Recursive Binary
• Kth Smallest
• Exponential
• Jump
• Fibonacci
• Quick Select

Geometry

• Closest pair of 2D points

Ciphers

• Caesar
• Morse Code
• Polybius
• SHA-2
• TEA
• Transposition
• Vigenère
• XOR
• Salsa20
• HMAC
• Rot13
  • Another Rot13
  • Rot13

Backtracking

• Sudoku
• All Combination of Size k

All implemented Algos

See DIRECTORY.md

Contributing

See CONTRIBUTING.md