Blockchain
Chinese Remainder Theorem
Ciphers
Conversions
Rgb Hsv Conversion
Data Compression
Data Structures
Bit Array
Timeline
Segment Tree
+3
Segment Tree Multiplication
Segment Tree Update
Array-based Stack
List-based Stack
Min-Max Heap
Binaryheap
Fibonacci Heap
Pairing Heap
Bloom Filter
Count Min Sketch
HyperLogLog
Array-based Queue
List-based Queue
Stack-based Queue
Singly Linked List
+3
Doubly Linked List
+3
Skip List
Directed Weighted Graph Via Adjacency Matrix
SortedList
Inverted index
Unrolled linked list
Tries
Least Frequently Used (LFU) Cache
Least Recently Used (LRU) Cache
Divide and Conquer
Dynamic Programming
Floyd Warshall
+2
Encoders
Fractals
Graphs
Prim's Algorithm (Adjacency Matrix)
Kruskal's Algorithm
Breadth First Search
+3
Depth First Search
+4
Dijkstra Shortest Path
Kosaraju
Backtracking
Hashing
Luhn
Knapsack
Linear Algebra
Math
Extended Euclidean Algorithm
Aliquot Sum
+3
Euclidean Gcd
Modular Exponentiation
Maclaurin Series
Binomial Coefficient
Factorial
+11
Perfect Square
+1
Euler Method
Automorphic Number
Josephus Problem
Euler's Totient
+1
Sieve of Eratosthenes
+4
Modular Arithmetic
Modular Multiplicative Inverse
Numeric
Amicable Numbers Checker
Thin Singular Vector Decomposition
Binary GCD
Trial division Factorization
Gauss-Jordan Elimination
Keith Number Checker
Pseudo-Inverse
Narcissistic Number Checker
Perfect Number Checker
Classic Runge-Kutta Method
Miller-Rabin primality check
KrishnamurthyNumberChecker
Newton's Square Root Calculation
Numerical Analysis
Lu Decomposition
Others
Fermat Prime Checker
Int2Binary
GeoLocation
Pareto Optimization
Gauss Optimization
Decisions Convolutions
Welford's Variance
Julian Easter
Pollard's Rho
Gale Shapley
Problems
Recursive
Flood Fill
Searches
Binary Search
+13
Recursive Binary Search
Linear Search
+12
Fast Search
Fibonacci Search
+4
Jump Search
+7
Sequences
A000002 Kolakoski
A000004 Zero
A000005 Count of Divisors
A000008 Make Change
A000012 All Ones
A000027 Natural
A000032 Lucas Numbers
A000040 Primes
A000045 Fibonacci
A000079 Powers of 2
A000108 Catalan
A000120 1's Counting
A000124 Central Polygonal Numbers
A000125 Cake Numbers
A000142 Factorial
A000213 Tribonacci Numbers
A000215 Fermat Numbers
A000288 Tetranacci Numbers
A000290 Squares
A000292 Tetrahedral numbers
A000578 Cubes
A000720 PrimePi
A001146 Number of Boolean Functions
A001462 Golomb's
A001478 Negative Integers
A002110 Primorial Numbers
A002717 Matchstick Triangle Arrangement
A005132 Recaman's
A006577 Number of '3n+1' steps to reach 1
A006862 Euclid Numbers
A006879 Number of Primes by Number of Digits
A006880 Number of Primes by Powers of 10
A007318 Binomial
A007395 All Twos
A010051 Binary Prime Constant
A010701 All Threes
A011557 Powers of 10
A057588 Kummer Numbers
A019434 Fermat Primes
A181391 Van Eck's
Shufflers
Fisher-Yates Shuffler
Sorts
Binary Insertion Sort
+1
Bogo Sort
+5
Bubble Sort
+18
Cocktail Sort
Comb Sort
+7
Cycle Sort
+4
Exchange Sort
Heap Sort
+12
Insertion Sort
+17
Pancake Sort
+5
Quick Sort
+18
Median of three pivot
Middle point pivot
Random pivot
Selection Sort
+13
Shell Sort
+8
Tim Sort
+1
Counting Sort
+6
Bucket Sort
+4
Radix Sort
+8
Msd Radix Sort
Knuth–Morris–Pratt Search
Strings
Burrows Wheeler Transform
Longest Consecutive Character
Naive String Search
Rabin Karp
+1
Boyer Moore
Palindrome Checker
Get all permutations of a string
Levenshtein Distance
+1
Hamming Distance
+4
