Algorithm: Difference between revisions
imported>Ragnar Schroder (→Basic algorithm designs: math markup error fixed) |
imported>Ragnar Schroder (Added section →Some well known algorithms) |
||
| Line 26: | Line 26: | ||
==Basic algorithm designs== | ==Basic algorithm designs== | ||
There are several general methods for designing algorithms. Some of the most common are | There are several general methods for designing algorithms. Some of the most common are | ||
*[[Divide and conquer]] strategies. These typically yield algorithms of <math>O(n \log n)</math> complexity, or better. | *[[Divide and conquer]] strategies. These typically yield algorithms of <math>O(n \log n)</math> complexity, or better. | ||
*The [[greedy method]]. | *The [[greedy method]]. | ||
*[[Dynamic programming]]. | *[[Dynamic programming]]. | ||
==Some well known algorithms== | |||
*[[Quicksort]] | |||
*The [[fast fourier transform]], also known as the fft. | |||
*The [[Euclidean algorithm]], known from number theory. | |||
==References== | ==References== | ||
Revision as of 17:57, 17 November 2007
An algorithm is a sequence of steps used to solve a problem. A cooking recipe can be considered an example of an algorithm, although the term is more frequently applied to the information processing instructions used in computer programs.
Introduction
An algorithm consists of the underlying recipe steps (print the value of X) rather than the actual computer program source code used to execute the steps (PRINT X). When encoded in computer programs, algorithms operate on data values, preferably data maintained in a consistent data structure. Thus an algorithm is the recipe, while the data structure is the well-stored ingredients on which the recipe is designed to operate.
Nicklaus Wirth, the inventor of the programming language Pascal, titled one of his books "Algorithms + Data Structures = Programs" (ISBN 0130224189) to indicate the complementary nature of algorithms and data structures, and their centrality to computing.
Algorithms are usually expressed independently of the programming language, typically in terms of a brief, informal list of commands called pseudocode, or diagrammatically in the form of a flowchart.
Examples of different categories of algorithms used in computer programming include:
- Bounding limit
- Compression
- Conversion
- Encryption
- Fourier transform
- Geometric
- Graphic
- Numeric
- Probabilistic
- Searching
- Sorting
- Text string
Basic algorithm designs
There are several general methods for designing algorithms. Some of the most common are
- Divide and conquer strategies. These typically yield algorithms of complexity, or better.
- The greedy method.
- Dynamic programming.
Some well known algorithms
- Quicksort
- The fast fourier transform, also known as the fft.
- The Euclidean algorithm, known from number theory.
References
- Ellis Horowitz and Sartaj Sahni (1978). Fundamentals of computer algorithms.
The classic texts on computer programming algorithms include three volumes written by Donald Knuth collectively titled "The Art of Computer Programming" (ISBN 0201485419).
Also useful is the book "Introduction to Algorithms" by Thomas Cormen, 2nd ed. Dec. 2003 (with CD) (ISBN 0072970545).