List of algorithms

The following is a list of the algorithms described in Wikipedia.

If you intend to describe a new algorithm, please read algorithms on Wikipedia first, then add a link to your article and a one-line description here.

• Compression algorithms:
  • Run-length encoding: lossless data compression
  • Huffman coding: simple lossless entropy coding
  • arithmetic coding: advanced entropy coding
  • LZW: lossless data compression
  • Burrows-Wheeler transform: preprocessing useful for lossless compression
  • Cyclic redundancy check: check word determination for detecting transmission errors
• Cryptographic algorithms:
  • AES: secret key symmetric encryption
  • Blowfish encryption algorithm: secret key symmetric encryption
  • Blum Blum Shub: a pseudorandom number generator with a security proof
  • DES: secret key symmetric encryption
  • Diffie-Hellman: key exchange
  • International Data Encryption Algorithm: secret key symmetric encryption
  • RC4: secret key symmetric encryption
  • RSA: public key asymmetric encryption
• Numerical algorithms:
  • Euclidean algorithm: computes the greatest common divisor
  • Exponentiating by squaring: quickly computes powers of numbers and matrices
  • Fast Fourier Transform: determines the frequencies contained in a (segment of a) signal
  • Gauss-Jordan elimination: solves systems of linear equations
  • Newton's method: finding zeros of functions with calculus
  • Pseudorandom number generators: produce statistically random output
  • Square root: approximates the square root of a number
• Quantum algorithms:
  • Grover's algorithm: provides quadratic speedup for many search problems
  • Shor's algorithm: provides exponential speedup for factorizing a number
• Search algorithms:
  • Binary search: locates an item in a sorted vector
  • Binary search tree
  • Linear search: finds an item in an unsorted list
• Sort algorithms:
  • Binary tree sort
  • Bubble sort
  • Heapsort
  • Insertion sort
  • Merge sort
  • Pigeonhole sort
  • Quicksort
  • Radix sort
• Graph algorithms:
  • Dijkstra's algorithm: computes shortest paths in a graph with non-negative edge weights
  • Kruskal's algorithm: finds a minimum spanning tree for a graph
  • Prim's algorithm: finds a minimum spanning tree for a graph
  • Ford-Fulkerson algorithm: computes the maximum flow in a graph
• Other:
  • Flood fill: fills a connected region of a multi-dimensional array with a specified symbol
  • Subset-sum: Accepts the NP-complete language Subset-sum in polynomial time iff P=NP
  • Halt: no one yet knows if this 43-byte C program ever halts