The Algorithms - Rust

The compression module includes several data compression techniques:

• Burrows-Wheeler Transform
• Huffman Encoding
• LZ77
• Move to Front
• Run Length Encoding
• Peak Signal-to-Noise Ratio (Metric)

The the_algorithms_rust repository provides implementations of various string-based algorithms. You can use these to perform tasks such as dictionary matching, pattern searching, compression, and calculating string metrics.

Available algorithms include:

• Aho-Corasick: Dictionary-matching for locating multiple strings simultaneously.
• Burrows-Wheeler transform: Reorganizes strings into runs of similar characters for compression.
• Knuth Morris Pratt (KMP): Linear-time pattern searching.
• Manacher: Finding the longest palindromic substring in linear time.
• Rabin Karp: Hashing-based pattern searching.
• Hamming Distance: Measuring the number of substitutions required to transform one string into another (requires equal length strings).
• Run Length Encoding: Lossless data compression by storing sequences of identical data as a value and a count.

The data_structures module contains various fundamental data structures and probabilistic structures:

• Trees: AVL Tree, B-Tree, Binary Search Tree, Fenwick Tree, Lazy Segment Tree, RB Tree, Segment Tree, Segment Tree Recursive, Treap, Trie, Veb Tree
• Linear/Other: Graph, Hash Table, Heap, Linked List, Queue, Stack Using Singly Linked List, Union Find
• Probabilistic: Bloom Filter, Count Min Sketch
• Specialized: Floyds Algorithm, Range Minimum Query

The repository includes several searching techniques:

• Standard Search: Binary Search (Iterative & Recursive), Linear Search, Exponential Search, Jump Search, Interpolation Search, Ternary Search.
• Specialized Search: Fibonacci Search, Saddleback Search, Quick Select, K-th Smallest (including Heap-based implementation).
• Other: Moore Voting.

The bit_manipulation module contains various low-level bitwise operations and algorithms, such as:

• Bit Counting/Finding: Counting Bits, Highest Set Bit, Rightmost Set Bit, Trailing Zeros
• Properties: Is Power of Two, Hamming Distance, Unique Number
• Transformations: Binary Coded Decimal, Binary Shifts, N Bits Gray Code, Reverse Bits, Swap Odd and Even Bits, Two's Complement
• Arithmetic: Sum of Two Integers
• Other: Missing Number, Previous Power of Two

The big_integer module provides algorithms for handling large integer operations, including:

• Fast Factorial
• Multiply
• Poly1305

The repository contains several implementations of backtracking algorithms. You can find specific implementations for tasks such as:

• Combinations: All Combinations of Size K
• Graph Problems: Graph Coloring, Hamiltonian Cycle, N-Queens
• Puzzles/Games: Knight Tour, Sudoku, Rat in Maze
• Mathematical/Logic: Parentheses Generator, Permutations, Subset Sum

The conversions module provides utilities for converting between different number systems, units, and formats:

• Number Systems: Binary, Decimal, Hexadecimal, Octal, Roman Numerals
• Physical Units: Energy, Length, Pressure, Speed, Temperature, Volume, Weight
• Color/Coordinate: RGB-CMYK, RGB-HSV, Rectangular to Polar
• Other: IPv4, Order of Magnitude, Time

Additional specialized algorithm categories available:

Navigation:

• Bearing
• Haversine
• Rhumbline

Number Theory:

• Compute Totient
• Euler Totient
• K-th Factor

The dynamic_programming module contains algorithms solved using dynamic programming techniques, such as:

• Catalan Numbers