User:Ragasvnvs/Books/MostAlgos
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
- List of algorithms
- Cycle detection
- Stable marriage problem
- Pseudorandom number generator
- Blum Blum Shub
- Lagged Fibonacci generator
- Linear congruential generator
- Mersenne twister
- Graph coloring
- Hopcroft–Karp algorithm
- Prüfer sequence
- Tarjan's off-line lowest common ancestors algorithm
- Topological sorting
- Force-directed graph drawing
- Spectral layout
- Girvan–Newman algorithm
- HITS algorithm
- PageRank
- TrustRank
- Flow network
- Dinic's algorithm
- Edmonds–Karp algorithm
- Ford–Fulkerson algorithm
- Karger's algorithm
- Push–relabel maximum flow algorithm
- Edmonds' algorithm
- Euclidean minimum spanning tree
- Longest path problem
- Minimum spanning tree
- Borůvka's algorithm
- Kruskal's algorithm
- Prim's algorithm
- Reverse-delete algorithm
- Nonblocking minimal spanning switch
- Bellman–Ford algorithm
- Dijkstra's algorithm
- Floyd–Warshall algorithm
- Johnson's algorithm
- Transitive closure
- Travelling salesman problem
- Christofides algorithm
- Nearest neighbour algorithm
- Knight's tour
- A* search algorithm
- B*
- Backtracking
- Beam search
- Beam stack search
- Best-first search
- Bidirectional search
- Bloom filter
- Breadth-first search
- D*
- Depth-first search
- General Problem Solver
- Iterative deepening depth-first search
- Jump point search
- Lexicographic breadth-first search
- Uniform-cost search
- SSS*
- Bron–Kerbosch algorithm
- Strongly connected component
- Path-based strong component algorithm
- Kosaraju's algorithm
- Tarjan's strongly connected components algorithm
- Bitap algorithm
- Phonetic algorithm
- Daitch–Mokotoff Soundex
- Metaphone
- Match rating approach
- New York State Identification and Intelligence System
- Soundex
- String metric
- Damerau–Levenshtein distance
- Sørensen–Dice coefficient
- Hamming distance
- Jaro–Winkler distance
- Levenshtein distance
- Trigram search
- Linear search
- Selection algorithm
- Ternary search
- Binary search algorithm
- Fibonacci search technique
- Jump search
- Interpolation search
- Uniform binary search
- Merge algorithm
- Fisher–Yates shuffle
- Robinson–Schensted correspondence
- Steinhaus–Johnson–Trotter algorithm
- Heap's algorithm
- Dynamic time warping
- Hirschberg's algorithm
- Needleman–Wunsch algorithm
- Smith–Waterman algorithm
- Bubble sort
- Cocktail sort
- Comb sort
- Gnome sort
- Odd–even sort
- Quicksort
- Flashsort
- Introsort
- Timsort
- Insertion sort
- Library sort
- Patience sorting
- Shellsort
- Tree sort
- Cycle sort
- Merge sort
- Strand sort
- Bead sort
- Bucket sort
- Burstsort
- Counting sort
- Pigeonhole sort
- Radix sort
- Heapsort
- Selection sort
- Smoothsort
- Bitonic sorter
- Pancake sorting
- Samplesort
- Maximum subarray problem
- Longest common subsequence problem
- Longest increasing subsequence
- Shortest common supersequence
- Longest common substring problem
- Aho–Corasick string matching algorithm
- Boyer–Moore string search algorithm
- Boyer–Moore–Horspool algorithm
- Knuth–Morris–Pratt algorithm
- Rabin–Karp algorithm
- Zhu–Takaoka string matching algorithm
- Ukkonen's algorithm
- Chien search
- Schreier–Sims algorithm
- Todd–Coxeter algorithm
- Buchberger's algorithm
- Cantor–Zassenhaus algorithm
- Faugère's F4 and F5 algorithms
- Gosper's algorithm
- Knuth–Bendix completion algorithm
- Gröbner basis
- Pollard's kangaroo algorithm
- Polynomial long division
- Risch algorithm
- Closest pair of points problem
- Collision detection
- Cone algorithm
- Convex hull algorithms
- Graham scan
- QuickHull
- Gift wrapping algorithm
- Chan's algorithm
- Kirkpatrick–Seidel algorithm
- Distance transform
- Geometric hashing
- Gilbert–Johnson–Keerthi distance algorithm
- Jump-and-Walk algorithm
- Laplacian smoothing
- Line segment intersection
- Bentley–Ottmann algorithm
- Minimum bounding box algorithms
- Nearest neighbor search
- Point in polygon
- Point set registration
- Rotating calipers
- Shoelace formula
- Triangulation (geometry)
- Delaunay triangulation
- Ruppert's algorithm
- Chew's second algorithm
- Marching triangles
- Polygon triangulation
- Voronoi diagram
- Bowyer–Watson algorithm
- Fortune's algorithm
- Quasi-triangulation
- Binary GCD algorithm
- Chakravala method
- Discrete logarithm
- Baby-step giant-step
- Index calculus algorithm
- Pollard's rho algorithm for logarithms
- Pohlig–Hellman algorithm
- Euclidean algorithm
- Extended Euclidean algorithm
- Integer factorization
- Congruence of squares
- Dixon's factorization method
- Fermat's factorization method
- General number field sieve
- Lenstra elliptic curve factorization
- Pollard's p − 1 algorithm
- Pollard's rho algorithm
- Quadratic sieve
- Special number field sieve
- Trial division
- Schönhage–Strassen algorithm
- Toom–Cook multiplication
- Odlyzko–Schönhage algorithm
- Primality test
- AKS primality test
- Baillie–PSW primality test
- Fermat primality test
- Lucas primality test
- Miller–Rabin primality test
- Sieve of Atkin
- Sieve of Eratosthenes
- Sieve of Sundaram
- Euler method
- Backward Euler method
- Trapezoidal rule (differential equations)
- Linear multistep method
- Runge–Kutta methods
- Multigrid method
- Partial differential equation
- Finite difference method
- Crank–Nicolson method
- Lax–Wendroff method
- Verlet integration
- Approximations of π
- Borwein's algorithm
- Gauss–Legendre algorithm
- Bailey–Borwein–Plouffe formula
- Division algorithm
- Long division
- BKM algorithm
- CORDIC
- Addition-chain exponentiation
- Exponentiation by squaring
- Montgomery reduction
- Booth's multiplication algorithm
- Fürer's algorithm
- Karatsuba algorithm
- Multiplicative inverse
- Newton's method
- Rounding
- Spigot algorithm
- Alpha max plus beta min algorithm
- Methods of computing square roots
- Nth root algorithm
- Shifting nth root algorithm
- Binary splitting
- Kahan summation algorithm
- Eigenvalue algorithm
- Arnoldi iteration
- Inverse iteration
- Jacobi eigenvalue algorithm
- Lanczos algorithm
- Power iteration
- QR algorithm
- Rayleigh quotient iteration
- Gram–Schmidt process
- Matrix multiplication
- Cannon's algorithm
- Coppersmith–Winograd algorithm
- Freivalds' algorithm
- Strassen algorithm
- Alpha–beta pruning
- Branch and bound
- Matrix chain multiplication
- Combinatorial optimization
- Greedy randomized adaptive search procedure
- Hungarian algorithm
- Dynamic programming
- Gradient descent
- Harmony search
- Interior point method
- Linear programming
- Line search
- Local search (optimization)
- Hill climbing
- Tabu search
- Minimax
- Best bin first
- Odds algorithm
- Subset sum problem
- Doomsday rule
- Zeller's congruence
- Computus
- BLAST
- Kabsch algorithm
- Velvet assembler
- Maximum parsimony (phylogenetics)
- Vincenty's formulae
- Lesk algorithm
- Stemming
- Sukhotin's algorithm
- Algorithms for calculating variance
- Approximate counting algorithm
- Bayesian statistics
- Nested sampling algorithm
- Cluster analysis
- UPGMA
- Canopy clustering algorithm
- Complete-linkage clustering
- DBSCAN
- Expectation–maximization algorithm
- Fuzzy clustering
- FLAME clustering
- K-means clustering
- K-means++
- K-medoids
- Linde–Buzo–Gray algorithm
- Lloyd's algorithm
- OPTICS algorithm
- Single-linkage clustering
- SUBCLU
- Ward's method
- Partial least squares regression
- Ziggurat algorithm
- Tomasulo algorithm
- Public-key cryptography
- Digital Signature Algorithm
- ElGamal encryption
- Elliptic curve cryptography
- NTRUEncrypt
- RSA (cryptosystem)
- Cryptographic hash function
- Hash-based message authentication code
- MD5
- RIPEMD
- SHA-1
- SHA-2
- Tiger (cryptography)
- Whirlpool (cryptography)
- Cryptographically secure pseudorandom number generator
- Fortuna (PRNG)
- Linear feedback shift register
- Yarrow algorithm
- Diffie–Hellman key exchange
- Secret sharing
- Shamir's Secret Sharing
- Symmetric-key algorithm
- Advanced Encryption Standard
- Blowfish (cipher)
- Data Encryption Standard
- International Data Encryption Algorithm
- RC4
- Tiny Encryption Algorithm
- ALOPEX
- Association rule learning
- Apriori algorithm
- Boosting (machine learning)
- AdaBoost
- BrownBoost
- LogitBoost
- LPBoost
- Bootstrap aggregating
- Decision tree learning
- C4.5 algorithm
- ID3 algorithm
- K-nearest neighbors algorithm
- Locality-sensitive hashing
- Artificial neural network
- Backpropagation
- Hopfield network
- Perceptron
- Pulse-coupled networks
- Radial basis function network
- Self-organizing map
- Random forest
- Reinforcement learning
- Q-learning
- SARSA
- Temporal difference learning
- Relevance vector machine
- Support vector machine
- Structured support vector machine
- Winnow (algorithm)
- C3 linearization
- Chaitin's algorithm
- Hindley–Milner type system
- Rete algorithm
- Sethi–Ullman algorithm
- CYK algorithm
- Earley parser
- GLR parser
- Inside–outside algorithm
- LL parser
- LR parser
- Canonical LR parser
- LALR parser
- Operator-precedence parser
- Simple LR parser
- Simple precedence parser
- Parsing expression grammar
- Recursive descent parser
- Shunting-yard algorithm
- Pratt parser
- Lexical analysis
- Deutsch–Jozsa algorithm
- Grover's algorithm
- Shor's algorithm
- Simon's problem
- Algorithms for Recovery and Isolation Exploiting Semantics
- Join (SQL)
- Block nested loop
- Hash join
- Nested loop join
- Sort-merge join
- Buddy memory allocation
- Garbage collection (computer science)
- Boehm garbage collector
- Cheney's algorithm
- Mark-compact algorithm
- Tracing garbage collection
- Reference counting
- Banker's algorithm
- Page replacement algorithm
- Adaptive replacement cache
- Karn's Algorithm
- Luleå algorithm
- Network congestion
- Exponential backoff
- Nagle's algorithm
- Dekker's algorithm
- Lamport's bakery algorithm
- Peterson's algorithm
- Earliest deadline first scheduling
- Fair-share scheduling
- Least slack time scheduling
- List scheduling
- Multilevel feedback queue
- Rate-monotonic scheduling
- Round-robin scheduling
- Shortest job next
- Shortest remaining time
- Top-nodes algorithm
- Elevator algorithm
- Shortest seek first