Main Page

encyclopedia.codeboy.net

 

List of algorithms

Category:Algorithms The following is a list of the algorithms described in Wikipedia. \nSee also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures. 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.

Table of contents
1 Combinatorial algorithms
2 Compression algorithms
3 Computational geometry
4 Computer graphics
5 Cryptographic algorithms
6 Data visualization
7 Imaging
8 Distributed systems algorithms
9 Numerical algorithms
10 Number-theoretic algorithms
11 Numerical algebra
12 Parsing
13 Software engineering
14 Quantum algorithms
15 Other

Combinatorial algorithms

General combinatorial algorithms

Graph algorithms

\nSee main article
graph theory

Combinatorial optimization

Search algorithms

String searching algorithms

Sort algorithms

  • Binary tree sort\n* Bogosort: humorous and slow\n* Bubble sort: for each pair of indices, swap the items if out of order\n* Heapsort: convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list\n* Insertion sort: determine where the current item belongs in the list of sorted ones, and insert it there\n* Merge sort: sort the first and second half of the list separately, then merge the sorted lists\n* Pigeonhole sort\n* Quicksort: divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice\n* Radix sort: sorts strings letter by letter\n* Selection sort: pick the smallest of the remaining elements, add it to the end of the sorted list\n* Shell sort: an attempt to improve insertion sort

Compression algorithms

Computational geometry

Computer graphics

\n

Cryptographic algorithms

\nSee also
Topics in cryptography for an 'analytical glossary')

Data visualization

  • Spring based algorithms

Imaging

\n

Distributed systems algorithms

\n*
Lamport ordering: a partial ordering of events based on the happened-before relation\n* Snapshot algorithm: a snapshot is the process of recording the global state of a system\n* Vector ordering: a total ordering of events

Numerical algorithms

\nSee also main article
numerical analysis and list of numerical analysis topics

Digital signal processing

\n*
CORDIC: Fast trigonometric function computation technique.\n* Fast Fourier transform: determines the frequencies contained in a (segment of a) signal\n**Cooley-Tukey FFT algorithm

Number-theoretic algorithms

Numerical algebra

Parsing

Software engineering

\n*
Algorithms for Recovery and Isolation Exploiting Semantics: recovery\n* Unicode Collation Algorithm\n* CHS conversion: Converting between disk addressing systems\n* Cyclic redundancy check: calculation of a check word\n* Parity: Simple/fast error detection technique. Is a number even or odd?

Quantum algorithms

\nApplication of
quantum computation to various categories of problems and algorithms \n

Other


"We don't like their sound, and guitar music is on the way out." - Decca Recording Co. rejecting the Beatles, 1962