The Algorithms
Backtracking
N Queens
Ciphers
Conversions
Rgb Hsv Conversion
Data Structures
Burrows-Wheeler transform
Huffman Compressor
Shannon-Fano Compressor
Hill
NYSIIS
Soundex
Naive solver
Dynamic Programming solver
Branch and bound solver
Aliquot Sum Calculator
Thin Singular Vector Decomposition
Binary GCD
Trial division Factorization
Maclaurin Series
Gauss-Jordan Elimination
Pseudo-Inverse
Narcissistic Number Checker
Perfect Number Checker
Perfect Square Checker
Recursive Binary Search
Fast Search
Median of three pivot
Middle point pivot
Random pivot
A000027 Natural
A000040 Primes
A000045 Fibonacci
A000142 Factorial
A007318 Binomial
Longest Consecutive Character
Boyer Moore
Palindrome Checker
Fermat Prime Checker
Stable Marriage
Segment Tree
Segment Tree Multiplication
Segment Tree Update
Binary Search Tree
+2
AA Tree
Array-based Stack
List-based Stack
Min-Max Heap
Binaryheap
Fibonacci Heap
Array-based Queue
List-based Queue
Stack-based Queue
Singly Linked List
Doubly Linked List
+3
Bit Array
Timeline
Fractals
Graphs
A Star
Hashing
Luhn
Linear Algebra
Power Iteration
Math
Numerical Analysis
Lu Decomposition
Recursive
FloodFill
Searches
Sorts
Binary Insertion Sort
Bogo Sort
+2
Bubble Sort
+15
Cocktail Sort
Comb Sort
+6
Cycle Sort
+1
Heap Sort
+11
Insertion Sort
+13
Pancake Sort
+2
Merge Sort
+16
Quick Sort
+15
Selection Sort
+12
Shell Sort
+7
Merge Sort
+16
Counting Sort
+4
Bucket Sort
+1
Radix Sort
+7
