- Quick Sort
- Merge Sort
- Bubble Sort
- Insertion Sort
- Selection Sort
- Heap Sort
- Binary Search
- Linear Search
- Jump Search
- Interpolation Search
- Exponential Search
- Dijkstra Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Kruskal Algorithm
- Prim Algorithm
- Topological Sort
- Kosaraju Algorithm
- Fibonacci (DP – Tabulation)
- Knapsack Problem (0/1)
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence (LIS)
- Coin Change Problem
- Edit Distance (Levenshtein)
- Matrix Chain Multiplication
- Subset Sum Problem
- Kadane Algorithm
- Egg Dropping Problem
- Euclidean GCD
- Sieve of Eratosthenes
- Modular Exponentiation
- Prime Factorization
- Chinese Remainder Theorem
- KMP Pattern Searching
- Rabin-Karp String Matching
- Boyer-Moore Algorithm
- Z-Algorithm
- Suffix Array Construction
- Binary Search Tree (BST) Insertion
- AVL Tree Rotations
- Red-Black Tree Insertion
- Binary Heap Operations
- Segment Tree Range Query
- Fenwick Tree (Binary Indexed Tree)
- Disjoint Set Union (DSU)
- Trie (Prefix Tree) Search
- Backtracking – N-Queens
- Sudoku Solver
- Ford-Fulkerson (Max Flow)
- Edmonds-Karp Algorithm
- Dinic Algorithm
- Hopcroft-Karp Algorithm
- Tarjan Strongly Connected Components
- Bridge and Articulation Point Finding
- A* Search Algorithm
- Minimax with Alpha-Beta Pruning
- Gradient Descent
- K-Means Clustering
- K-Nearest Neighbors (KNN)
- Naive Bayes Classifier
- Convex Hull – Graham Scan
- Convex Hull – Jarvis March
- Line Intersection Test
- Point in Polygon (Ray Casting)
- Shoelace Formula
- Fast Fourier Transform (FFT)
- Matrix Exponentiation
- Extended Euclidean Algorithm
- Miller-Rabin Primality Test
- Pollard Rho Algorithm
- Reservoir Sampling
- Fisher-Yates Shuffle
- Bloom Filter
- Count-Min Sketch
- Skip List
- B-Tree Insertion & Search
- Treap (Tree + Heap)
- LRU Cache
- LFU Cache
- Aho-Corasick Algorithm
- Manacher Algorithm
- Suffix Automaton
- Burrows-Wheeler Transform
- Huffman Coding
- Run-Length Encoding (RLE)
- Simulated Annealing
- Genetic Algorithm
- Ant Colony Optimization
- RSA Encryption
- Diffie-Hellman Key Exchange
- MD5 Message Digest
- SHA-256 Hash Function
- Token Bucket Rate Limiting
- Leaky Bucket Rate Limiting
- Consistent Hashing
- Paxos Consensus Algorithm
- Raft Consensus Algorithm
- MapReduce Word Count
- Minimum Cost Maximum Flow (MCMF)
- Eulerian Path and Circuit
- 2-Satisfiability (2-SAT)
- Heavy-Light Decomposition (HLD)
- Centroid Decomposition
- Biconnected Components & Block-Cut Tree
- Dominator Tree (Lengauer-Tarjan)
- Yen Algorithm (K-Shortest Paths)
- Stoer-Wagner Min Cut Algorithm
- Branch and Bound for TSP
- Persistent Segment Tree
- Link-Cut Tree
- Splay Tree
- Wavelet Tree
- K-D Tree (K-Dimensional Tree)
- Quadtree Spatial Indexing
- Octree 3D Spatial Indexing
- Ukkonen Algorithm (Suffix Tree)
- Leftist Heap (Leftist Tree)
- Van Emde Boas Tree
- Implicit Treap
- R-Tree Spatial Database
- DSU with Rollback
- Cartesian Tree
- Convex Hull Trick (CHT)
- Knuth Optimization for DP
- Divide and Conquer DP Optimization
- Digit DP (Dynamic Programming on Digits)
- SOS DP (Sum Over Subsets)
- Slope Trick
- Aliens Trick (WQS Binary Search)
- Tree DP (Dynamic Programming on Trees)
- Profile DP (Broken Profile DP)
- Monotone Queue DP Optimization
- Baby-Step Giant-Step (BSGS)
- Fast Walsh-Hadamard Transform (FWHT)
- Pollard p-1 Algorithm
- Lucas Theorem
- Primitive Root Finding
- Quadratic Reciprocity & Legendre Symbol
- Berlekamp-Massey Algorithm
- Number Theoretic Transform (NTT)
- Garner Algorithm
- Tonelli-Shanks Algorithm
- Mobius Inversion & Sieve
- Linear Diophantine Equation Solver
- Euler Totient Function Sieve
- Pell Equation Solver
- Lenstra Elliptic Curve Factorization (ECM)
- Rotating Calipers Algorithm
- Half-Plane Intersection
- Delaunay Triangulation
- Voronoi Diagram Construction
- Closest Pair of Points (2D)
- Point in Convex Polygon Query
- Minkowski Sum of Polygons
- Pick Theorem Implementation
- 3D Convex Hull
- Sweepline Segment Intersection
- Polygon Triangulation (Ear Clipping)
- Circle-Circle Intersection
- Sprague-Grundy Theorem
- Expectiminimax Algorithm
- Burnside Lemma & Polya Counting
- Monte Carlo Tree Search (MCTS)
- Markov Chain Monte Carlo (MCMC)
- Viterbi Algorithm
- Baum-Welch Algorithm
- Metropolis-Hastings Algorithm
- Kelly Criterion Calculation
- Random Walk Simulation
- HNSW (Hierarchical Navigable Small World)
- Locality-Sensitive Hashing (LSH)
- Two-Phase Commit Protocol (2PC)
- Three-Phase Commit Protocol (3PC)
- Gossip Protocol
- Chandy-Lamport Snapshot Algorithm
- Bully Algorithm for Leader Election
- Merkle Tree Synchronization
- HyperLogLog Cardinality Estimation
- Cuckoo Filter
- Reed-Solomon Erasure Coding
- Product Quantization (PQ)
- Inverted Index Construction
- Raft Log Compaction & Snapshotting
- Multi-Paxos Protocol
- Consistent Hashing with Vnodes
- Count-Min Sketch Heavy Hitters
- Scalable Bloom Filter
- Canny Edge Detection
- SIFT (Scale-Invariant Feature Transform)
- RANSAC (Random Sample Consensus)
- Watershed Image Segmentation
- Hough Transform (Line & Circle)
- Lucas-Kanade Optical Flow
- Harris Corner Detector
- Otsu Thresholding
- Active Contour Model (Snakes)
- Mean Shift Clustering & Segmentation
- Support Vector Machines (SVM)
- Random Forest Ensemble
- Gradient Boosting Core (XGB/LGB)
- Principal Component Analysis (PCA)
- t-SNE (t-Distributed Stochastic Neighbor Embedding)
- UMAP (Uniform Manifold Approximation)
- TF-IDF (Term Frequency-Inverse Document Frequency)
- Word2Vec (Skip-gram & CBOW)
- Beam Search Decoding
- BPE (Byte-Pair Encoding Tokenization)
- Elliptic Curve Cryptography (ECC)
- AES Encryption Rounds Structure
- SHA-3 (Keccak Sponge Construction)
- Zero-Knowledge Proof Core (Sigma Protocol)
- Diffie-Hellman Ephemeral (DHE)
- PBKDF2 & Argon2 Password Hashing
- HMAC (Hash-based Message Authentication)
- ChaCha20-Poly1305 Authenticated Encryption
- Paillier Cryptosystem (Homomorphic Encryption)
- Shamir Secret Sharing Scheme
- TCP BBR Congestion Control
- OSPF Link-State Routing (Dijkstra in Router)
- BGP Path Vector Routing
- Consistent Subnet Masking (CIDR Matching)
- RED (Random Early Detection)
- TCP Cubic Congestion Control
- Token Bucket Traffic Shaper
- Distance Vector Routing (Bellman-Ford Network)
- DNS Iterative Resolution Algorithm
- STP (Spanning Tree Protocol)
- Flajolet-Martin Algorithm
- T-Digest Percentile Estimation
- Misra-Gries Heavy Hitters
- Exponential Decay Reservoir Sampling
- Top-K Stream Processing (Space-Saving)
- Count Sketch
- AMLS (Adaptive Maximum Likelihood Sampling)
- Min-Hash LSH for Jaccard Similarity
- SimHash Document Fingerprinting
- Billion-Scale Vector Quantization (IVF-PQ)
- Practical Byzantine Fault Tolerance (PBFT)
- Raft Joint Consensus Configuration Change
- Viewstamped Replication (VSR)
- CRDT State-based (CvRDT)
- CRDT Operation-based (CmRDT)
- Proof of Stake (PoS Slot Leader Election)
- Leased-Based Distributed Locking
- Vector Clocks Causality Tracking
- Distributed Hash Table (DHT – Kademlia)
- Distributed Snapshot (Mattern Algorithm)
- Completely Fair Scheduler (CFS – Linux)
- Banker Deadlock Avoidance Algorithm
- Multilevel Feedback Queue Scheduler
- ARC (Adaptive Replacement Cache)
- Buddy Memory Allocation Algorithm
- Page Replacement – LRU-K Algorithm
- RCU (Read-Copy Update Synchronization)
- Slab Allocator Memory Management
- Priority Inheritance Protocol
- Copy-on-Write (COW) Mechanism
- Ray Marching (Sphere Tracing)
- BVH (Bounding Volume Hierarchy) Construction
- Marching Cubes Isosurface Extraction
- Catmull-Rom Spline Interpolation
- Bezier Curve Subdivision (De Casteljau)
- Quaternion Spherical Linear Interpolation (SLERP)
- GJK Collision Detection (Gilbert-Johnson-Keerthi)
- Impulse-Based Rigid Body Resolution
- Perlin Noise Generation
- Shadow Mapping Algorithm
- Tabu Search Optimization
- Particle Swarm Optimization (PSO)
- Artificial Bee Colony (ABC) Algorithm
- Firefly Optimization Algorithm
- Interior Point Method (Linear Programming)
- Simplex Algorithm Core
- Ant System (AS) for TSP
- Cuckoo Search Optimization
- Differential Evolution (DE)
- Harmony Search Algorithm
- Christofides Algorithm (Metric TSP Approx)
- Vertex Cover 2-Approximation
- Max-Cut Local Search Algorithm
- Welsh-Powell Graph Coloring Greedy
- PageRank Power Iteration Calculation
- Edmonds Blossom Algorithm (General Matching)
- Kruskal-Wallis Rank Sum Test
- Mann-Whitney U Test
- Wilcoxon Signed-Rank Test
- Apriori Association Rule Algorithm
- Paxos Made Simple Algorithm
- Raft Membership Joint Consensus
- Spanner TrueTime API Protocol
- Chandy-Misra-Haas Deadlock Detection
- Bully Election Algorithm
- Distributed Hash Ring Virtual Nodes
- Vector Clock Causality Tracking
- Gossip Dissemination Protocol
- Lease-Based Synchronization Protocol
- CRDT Observed-Remove Set (OR-Set)
- Linux CFS (Completely Fair Scheduler)
- Banker Algorithm Deadlock Avoidance
- Buddy Memory Allocation
- Slab Allocator Kernel Memory
- Copy-on-Write (COW) Fork
- Page Replacement Second-Chance (Clock)
- Ray Marching Signed Distance Fields
- BVH (Bounding Volume Hierarchy)
- Quaternion SLERP Interpolation
- GJK Collision Detection Algorithm
- Tabu Search Metaheuristic
- Artificial Bee Colony (ABC)
- Christofides Algorithm (Metric TSP)
- Welsh-Powell Graph Coloring
- PageRank Power Iteration
- Edmonds Blossom General Matching
- Apriori Association Rule Mining
- FP-Growth Algorithm
- DBSCAN Density-Based Clustering
- OPTICS Density-Based Clustering
- Isolation Forest Anomaly Detection
- Hidden Markov Model Forward-Backward
- Conditional Random Fields (CRF)
- FastICA (Independent Component Analysis)
- Locality Sensitive Hashing (LSH)
- Hierarchical K-Means (IVF)
- Simulated Annealing Metaheuristic
- Genetic Algorithm Core Evolution
- Memetic Algorithm Hybrid Optimization
- Scatter Search Optimization
- Imperialist Competitive Algorithm
- Teaching-Learning-Based Optimization
- Gravitational Search Algorithm
- Stochastic Gradient Descent with Momentum
- Adam Optimization Algorithm
- RMSprop Optimization Algorithm
- Levenberg-Marquardt Curve Fitting
- Nelder-Mead Simplex Optimization
- Fast Fourier Transform (Cooley-Tukey)
- Strassen Matrix Multiplication
- Coppersmith-Winograd Matrix Multiply
- LU Matrix Decomposition
- QR Matrix Decomposition
- Cholesky Decomposition
- Singular Value Decomposition (SVD)
- Gauss-Jordan Elimination
- Power Iteration Eigenvalue Solver
- QR Algorithm for Eigenvalues
- Ford-Fulkerson Max Flow
- Edmonds-Karp Max Flow
- Dinic Algorithm Max Flow
- Push-Relabel Max Flow Algorithm
- Hopcroft-Karp Bipartite Matching
- Kosaraju Strongly Connected Components
- Bridge and Articulation Point Detection
- A* Heuristic Search Algorithm
- Needleman-Wunsch Global Alignment
- Smith-Waterman Local Alignment
- BLAST Database Search Core
- Hidden Markov Model Gene Finding
- Neighbor-Joining Phylogenetic Tree
- UPGMA Hierarchical Clustering
- Burrows-Wheeler Transform (BWT)
- FM-Index Genomic Indexing
- De Bruijn Graph Assembly
- Protein Folding Monte Carlo Energy Min
- Zuker RNA Secondary Structure Prediction
- Clustal-Style Multiple Sequence Alignment
- MaCH Genotype Imputation
- MEME Motif Discovery Algorithm
- DC3 Suffix Array Construction
- Shor Integer Factorization Quantum Circuit
- Grover Quantum Database Search
- Quantum Phase Estimation (QPE)
- Quantum Fourier Transform (QFT)
- Variational Quantum Eigensolver (VQE)
- QAOA (Quantum Approximate Optimization)
- CRYSTALS-Kyber Key Encapsulation
- CRYSTALS-Dilithium Digital Signature
- Surface Code Quantum Error Correction
- Quantum Teleportation Protocol
- Deutsch-Jozsa Quantum Algorithm
- Bernstein-Vazirani Quantum Algorithm
- Simon Period Finding Algorithm
- Quantum Amplitude Amplification
- Extended Kalman Filter (EKF) SLAM
- FastSLAM (Particle Filter SLAM)
- Iterative Closest Point (ICP) Registration
- RRT* (Rapidly-exploring Random Tree Star)
- Probabilistic Roadmap (PRM) Planning
- Dynamic Window Approach (DWA) Navigation
- Artificial Potential Field Navigation
- Occupancy Grid Mapping Update
- Graph-based SLAM (Pose Graph Optimization)
- Unscented Kalman Filter (UKF)
- Chaitin-Briggs Register Allocation
- Static Single Assignment (SSA) Construction
- Dominance Frontier Calculation
- Loop Invariant Code Motion (LICM)
- Hindley-Milner Type Inference
- Cheney Copying Garbage Collector
- Generational GC Remembered Set Barrier
- Inline Caching Method Dispatch
- Escape Analysis for Object Allocation
- Andersen Pointer Analysis
- Black-Scholes Option Pricing Formula
- Binomial Options Pricing Tree Model
- Monte Carlo Asset Price Path Simulation
- Historical Value at Risk (VaR)
- GARCH(1,1) Volatility Estimation
- Kalman Filter Pairs Trading Cointegration
- Markowitz Mean-Variance Portfolio Optimization
- Black-Litterman Asset Allocation
- Longstaff-Schwartz American Option Pricing
- Order Book Matching Engine Priority Queue
- Persistent Homology Vietoris-Rips Filtration
- Alpha Shapes 2D/3D Boundary Extraction
- Weisfeiler-Lehman Graph Isomorphism Kernel
- Gomory-Hu Cut Tree Construction
- Planar Graph Hopcroft-Tarjan Embedding
- Suffix Automaton (Blumer Algorithm)
- Aho-Corasick Multi-Pattern Matching
- Bulletproofs Range Proof Verification
- Groth16 Pairing-Based ZK-SNARK
- BLS Signature Aggregation Protocol
- Verifiable Random Function (VRF)
- Threshold Secret Sharing (Shamir Extension)
- HoneyBadgerBFT Asynchronous Consensus
- Tendermint BFT State Machine Replication
- Equihash Memory-Hard Proof-of-Work
- Fully Homomorphic Encryption (FHE) Bootstrapping
- Consistent Hashing Distributed Load Balancer
- Token Bucket Rate Limiter Algorithm
- Leaky Bucket Traffic Shaping
- Sliding Window Log Rate Limiter
- Sliding Window Counter Rate Limiter
- Distributed Lock with Redis Redlock
- Rayleigh-Ritz Matrix Eigenvalue Solver
- Gauss-Seidel Linear System Iteration
- Jacobi Iterative Method for Linear Systems
- Successive Over-Relaxation (SOR)
- Conjugate Gradient Method (CG)
- GMRES (Generalized Minimal Residual)
- Arnoldi Iteration for Krylov Subspace
- Lanczos Iteration for Symmetric Matrices
- Fast Multipole Method (FMM)
- Barnes-Hut N-Body Simulation Algorithm
- Runge-Kutta 4th Order (RK4) ODE Solver
- Euler Explicit & Implicit ODE Solvers
- Verlet Integration for Molecular Dynamics
- Leapfrog Integration Algorithm
- Fast marching method (FMM Distance Map)
- Level Set Method Interface Propagation
- Marching Tetrahedra Isosurface Extraction
- Q-Learning Reinforcement Learning Core
- SARSA (State-Action-Reward-State-Action)
- Policy Gradient (REINFORCE Algorithm)
- Proximal Policy Optimization (PPO)
Cập nhật: 29.10.2026