List of algorithms

Related pages

LPBoost | Random forest | Methods of computing square roots | Lattice (group) | Bootstrap aggregating | ElGamal encryption | Cyclic redundancy check | Fast folding algorithm | Bilinear interpolation | Maximum cardinality matching | Vector optimization | Powerset construction | Luhn mod N algorithm | Cone tracing | Stochastic tunneling | Christofides algorithm | Cryptographic hash function | Delaunay triangulation | RSA (cryptosystem) | Point in polygon | Quicksort | Algorithms for Recovery and Isolation Exploiting Semantics | Stooge sort | Gauss–Legendre algorithm | Online algorithm | Slerp | Flow network | Tree sort | Chan's algorithm | Match rating approach | Verlet integration | TrustRank | Strand sort | Swarm intelligence | Unrestricted algorithm | Bailey–Borwein–Plouffe formula | LogitBoost | Gram–Schmidt process | Schreier–Sims algorithm | Monte Carlo method | Markov decision process | Parsing expression grammar | Selection sort | Line drawing algorithm | AdaBoost | Luleå algorithm | Tiger (hash function) | K-medoids | Estimation theory | Rewriting | Minimum bounding box algorithms | Arithmetical hierarchy | Gift wrapping algorithm | Mathematical constant | Single-linkage clustering | Bowyer–Watson algorithm | Exponential function | OPTICS algorithm | Dekker's algorithm | Binary splitting | Path-based strong component algorithm | Bron–Kerbosch algorithm | ALOPEX | Burrows–Wheeler transform | Flood fill | Hidden Markov model | Pearson hashing | Spaghetti sort | List of random number generators | Sparse matrix | Binary GCD algorithm | Buchberger's algorithm | Monotone cubic interpolation | Tiny Encryption Algorithm | Kabsch algorithm | Sequence alignment | Uniform binary search | K-means++ | Berlekamp–Massey algorithm | Linear programming | Pigeonhole sort | Hermite interpolation | Numerical integration | Tarjan's off-line lowest common ancestors algorithm | Damerau–Levenshtein distance | Stable marriage problem | Strassen algorithm | Ray tracing (graphics) | Fibonacci search technique | International Data Encryption Algorithm | Constrained Delaunay triangulation | Floyd–Warshall algorithm | Threefish | B* | Transitive closure | Yamartino method | Toeplitz matrix | Cristian's algorithm | Bully algorithm | Glauber dynamics | Collision detection | Gosper's algorithm | Post-quantum cryptography | Importance sampling | Set (mathematics) | Birkhoff interpolation | Parity bit | Risch algorithm | Message authentication code | Dijkstra's algorithm | Mutual exclusion | Phonetic algorithm | Tree traversal | DPLL algorithm | Artificial neural network | Dynamic time warping | Locality-sensitive hashing | Relevance vector machine | Stone's method | Kalman filter | Gröbner basis | Shortest path problem | Bentley–Ottmann algorithm | Chaff algorithm | Hamming weight | Fermat's factorization method | Shortest common supersequence problem | Banker's algorithm | Heap's algorithm | Benson's algorithm | Quine–McCluskey algorithm | Radon transform | Gordon–Newell theorem | Pareto interpolation | Gouraud shading | Pollard's rho algorithm | LL parser | Trigram search | Rayleigh quotient iteration | Levenshtein distance | Fast multipole method | Tonelli–Shanks algorithm | Minimum bounding box | Berkeley algorithm | Painter's algorithm | Cutting-plane method | Dynamic Markov compression | Introsort | Odlyzko–Schönhage algorithm | Wang and Landau algorithm | Fowler–Noll–Vo hash function | Vincenty's formulae | B-spline | Convex hull algorithms | Cross-entropy method | Deterministic automaton | Ruzzo–Tompa algorithm | Alpha max plus beta min algorithm | Fletcher's checksum | Minimum degree algorithm | Algorithm | Knuth–Morris–Pratt algorithm | Lagrange polynomial | Ford–Fulkerson algorithm | Tricubic interpolation | Snapshot algorithm | Bézier curve | Insertion sort | Timsort | Ricart–Agrawala algorithm | Special number field sieve | Permutation group | Borůvka's algorithm | Markov chain Monte Carlo | Ritz method | Hamming code | Simulated annealing | Eigenvalue algorithm | Exponential-Golomb coding | Isosurface | Jaccard index | Partial least squares regression | Addition-chain exponentiation | Hungarian algorithm | Baillie–PSW primality test | Toom–Cook multiplication | Linear congruential generator | Richardson–Lucy deconvolution | Pohlig–Hellman algorithm | Vatti clipping algorithm | Bitonic sorter | Young tableau | Discrete logarithm | BKM algorithm | Poly1305 | ACORN (PRNG) | Double dabble | Simplex algorithm | Lenstra–Lenstra–Lovász lattice basis reduction algorithm | Johnson's algorithm | Salsa20 | Metaheuristic | Nearest neighbor search | Differential evolution | Coset | Fuzzy clustering | Baby-step giant-step | Knuth–Bendix completion algorithm | Antipodal point | Kruskal's algorithm | Karn's algorithm | Probabilistic context-free grammar | Simple precedence parser | Sieve of Atkin | State–action–reward–state–action | List of algorithm general topics | Dynamical system | Lucas primality test | Perfect matching | Jump point search | Evolutionary computation | Cluster analysis | Goertzel algorithm | DFA minimization | Particle swarm optimization | Scanline rendering | String metric | Packrat parser | Polynomial interpolation | Metaphone | Backward Euler method | KHOPCA clustering algorithm | Hash join | Marzullo's algorithm | SHA-3 | Marching squares | Maximum flow problem | Midpoint circle algorithm | Chakravala method | Demon algorithm | Longitudinal redundancy check | Binary search algorithm | Block nested loop | Incremental heuristic search | Cannon's algorithm | Linde–Buzo–Gray algorithm | Gradient descent | Interpolation search | Bees algorithm | Cycle detection | Gray code | Library sort | Jump-and-Walk algorithm | Algorithms for calculating variance | Rotating calipers | Viterbi algorithm | Lagged Fibonacci generator | FLAME clustering | Iterative deepening depth-first search | Partial differential equation | Memetic algorithm | Polygon triangulation | Soundex | Runge–Kutta methods | Peterson's algorithm | Cone algorithm | Euler method | Convex polygon | Girvan–Newman algorithm | Hidden-surface determination | Duality (mathematics) | Deutsch–Jozsa algorithm | Fatigue (material) | Round-robin scheduling | Cocktail shaker sort | Halley's method | Huang's algorithm | Power iteration | Counting sort | Gnome sort | Kirkpatrick–Seidel algorithm | Bucket sort | Radix sort | BrownBoost | D* | Garbage collection (computer science) | Complete-linkage clustering | Prime-factor FFT algorithm | Shortest job next | Affine transformation | Leader election | Grover's algorithm | Levenberg–Marquardt algorithm | Pi | False nearest neighbor algorithm | Topological sorting | Selection algorithm | EdDSA | Multiplication algorithm | Schönhage–Strassen algorithm | Optimal substructure | Booth's multiplication algorithm | Buddy memory allocation | Barnes–Hut simulation | Karger's algorithm | Mersenne Twister | Elias gamma coding | NTRUEncrypt | Extended Euclidean algorithm | Bresenham's line algorithm | Xiaolin Wu's line algorithm | Knight's tour | Symbolic Cholesky decomposition | Quickhull | Cantor–Zassenhaus algorithm | Trial division | Voronoi diagram | Digital Signature Algorithm | Crank–Nicolson method | Sieve of Sundaram | Trigonometric interpolation | Reverse-delete algorithm | Geometric hashing | SHA-2 | Assignment problem | Long division | PageRank | Ambient occlusion | Q-learning | Digital signature | Perceptron | Tarski–Kuratowski algorithm | QR algorithm | Nested sampling algorithm | Subset sum problem | Recursion | Multiplicative inverse | Trie | N-body problem | Hamming distance | Euclidean algorithm | Elliptic-curve Diffie–Hellman | Trapezoidal rule (differential equations) | AKS primality test | Package-merge algorithm | Dancing Links | Luhn algorithm | Minimax | Rate-monotonic scheduling | Prüfer sequence | Analytical hierarchy | Top-down parsing | Least squares | Zhu–Takaoka string matching algorithm | Adaptive replacement cache | Self-organizing map | Spectral layout | Chomsky normal form | Bicubic interpolation | Magnitude (mathematics) | Basis (linear algebra) | Ordered subset expectation maximization | Calculus | MaxCliqueDyn maximum clique algorithm | Linear-feedback shift register | Pell's equation | List scheduling | Matrix multiplication | Fair-share scheduling | Fractal dimension | Cheney's algorithm | Scoring algorithm | Logistic regression | Constraint satisfaction | Branch and bound | Metric space | Minimum cut | Reference counting | Elevator algorithm | Reinforcement learning | Lax–Wendroff method | PBKDF2 | Multivariate interpolation | Shortest seek first | Cooley–Tukey FFT algorithm | Image-based lighting | Daitch–Mokotoff Soundex | Evolution strategy | Pareto distribution | Secant method | Diffie–Hellman key exchange | Comb sort | Triangulation (geometry) | Gilbert–Johnson–Keerthi distance algorithm | Floyd–Steinberg dithering | Nested loop join | System of linear equations | Index calculus algorithm | Lexicographic breadth-first search | Yarrow algorithm | Newell's algorithm | Dinic's algorithm | Gibbs sampling | Forward error correction | Pollard's rho algorithm for logarithms | Local search (optimization) | Line search | Bisection method | Fibonacci coding | Hirschberg's algorithm | Smith–Waterman algorithm | Best-first search | Finite difference method | Gene expression programming | Alpha–beta pruning | Advanced Encryption Standard | Phong shading | Strong generating set | Laplacian smoothing | Convex hull | Boyer–Moore string-search algorithm | Levinson recursion | Causality | Linear classifier | GLR parser | MD5 | Twofish | Biconjugate gradient method | Support vector machine | Blind deconvolution | Heapsort | Contour line | Operator-precedence parser | Sieve of Eratosthenes | DBSCAN | Sweep line algorithm | Newton's method in optimization | Damm algorithm | Recurrent neural network | Graham scan | Truncation selection | Marching triangles | Shellsort | Elias delta coding | Cuthill–McKee algorithm | Fractal compression | Graph cuts in computer vision | Jacobi eigenvalue algorithm | Lanczos resampling | Raymond's algorithm | Steinhaus–Johnson–Trotter algorithm | De Casteljau's algorithm | Nagle's algorithm | Borwein's algorithm | Tournament selection | Secret sharing | Modular arithmetic | CYK algorithm | Convex set | Riemann zeta function | Delta encoding | Adler-32 | Combinatorial optimization | Pancake sorting | Tabu search | Canonical LR parser | Scrypt | Zeller's congruence | New York State Identification and Intelligence System | Kahan summation algorithm | Successive over-relaxation | Point cloud | Metropolis–Hastings algorithm | Zobrist hashing | Elias omega coding | Baum–Welch algorithm | Miller–Rabin primality test | Petrick's method | Todd–Coxeter algorithm | Fortuna (PRNG) | Longest common substring problem | Nondeterministic algorithm | Cholesky decomposition | Arbitrary-precision arithmetic | Temporal difference learning | Warnock algorithm | Maekawa's algorithm | Linear interpolation | Needleman–Wunsch algorithm | Exponential backoff | Jump search | Probability distribution | Path tracing | Shortest remaining time | Davis–Putnam algorithm | Exact cover | Slowsort | Bead sort | Ellipsoid method | Bruun's FFT algorithm | Levenshtein coding | Unary coding | Consensus (computer science) | Newton's method | Inverse iteration | SUBCLU | Nelder–Mead method | Shor's algorithm | Chandy–Lamport algorithm | Chudnovsky algorithm | Multigrid method | Greedy randomized adaptive search procedure | Nearest neighbour algorithm | Cycle sort | Golden-section search | Fisher–Yates shuffle | Karmarkar's algorithm | SipHash | Tridiagonal matrix algorithm | Decision tree learning | Blowfish (cipher) | Discrete Fourier transform | BCJR algorithm | Edmonds' algorithm | Longest path problem | Smoothsort | Rader's FFT algorithm | Ukkonen's algorithm | Chandra–Toueg consensus algorithm | Bogosort | SSS* | Division algorithm | Metropolis light transport | Buzen's algorithm | Global illumination | Medoid | Branch and cut | Samplesort | Prim's algorithm | Kosaraju's algorithm | Key derivation function | Prime number | VEGAS algorithm | Top-nodes algorithm | Computational complexity theory | Tarjan's strongly connected components algorithm | Dantzig–Wolfe decomposition | Shamir's Secret Sharing | Difference-map algorithm | Neville's algorithm | Linear search | Beam stack search | Key stretching | Photon mapping | Integer factorization | Hopcroft–Karp algorithm | Muller's method | Stochastic universal sampling | Karatsuba algorithm | Recursive descent parser | Key exchange | BLAKE (hash function) | Context-free grammar | Flashsort | Hamming(7,4) | Bayesian statistics | Pollard's p − 1 algorithm | CORDIC | Gauss–Seidel method | Odds algorithm | Congruence of squares | Priority queue | Quickselect | Intersection algorithm | Pollard's kangaroo algorithm | Subgraph isomorphism problem | Edmonds–Karp algorithm | Least slack time scheduling | Rete algorithm | Verhoeff algorithm | Backpropagation | Bitap algorithm | Linear multistep method | Gauss–Newton algorithm | Association rule learning | Conjunctive normal form | Runge's phenomenon | Chaitin's algorithm | Ziggurat algorithm | Beam search | Matrix multiplication algorithm | Nearest-neighbor interpolation | Approximate counting algorithm | Reed–Solomon error correction | Simple LR parser | Merge sort | Cipolla's algorithm | K-means clustering | Polynomial long division | AC-3 algorithm | Polynomial | Blum Blum Shub | C4.5 algorithm | Minimum spanning tree | Entropy | Arnoldi iteration | Apriori algorithm | Spline interpolation | Odd–even sort | Clique (graph theory) | SHA-1 | Clipping (computer graphics) | Huffman coding | Backtracking | Canopy clustering algorithm | De Bruijn graph | Breadth-first search | Bidirectional search | Fast Fourier transform | Burstsort | Patience sorting | LR parser | Brute-force search | Marching cubes | Quadratic sieve | Clock synchronization | Ward's method | Euclidean minimum spanning tree | Data Encryption Standard | Data mining | Lowest common ancestor | Suffix tree | Argon2 | Freivalds' algorithm | Earliest deadline first scheduling | Chien search | Hash tree (persistent data structure) | ID3 algorithm | Depth-first search | Greatest common divisor | Lloyd's algorithm | Bcrypt | Gaussian elimination | Earley parser | Fitness proportionate selection | Distributed algorithm | Longest common subsequence problem | Primality test | Ramer–Douglas–Peucker algorithm | Bellman–Ford algorithm | Bubble sort | Spigot algorithm | General number field sieve | Hyperparameter optimization | Jaro–Winkler distance | Radial basis function network | A* search algorithm | WACA clustering algorithm | Ternary search | Nonblocking minimal spanning switch | Line clipping | Pseudorandom number generator | Beam tracing | Fermat primality test | Introselect | Basis function | UPGMA | Boyer–Moore–Horspool algorithm