Computer science Algorithms as mathematical objects Concept
Algorithm
Summary
An algorithm is a finite, precise list of instructions that transforms an input into an output by a sequence of elementary steps. Each step is determined by the instructions and the current data, and for every admissible input the process stops after finitely many steps. Algorithms are the objects that computer science designs and analyses, and the Turing machine gives one standard way to make the notion mathematically exact.
Where this leads
33 pages build on this one.
- Sardinas–Patterson algorithm
- Christofides algorithm
- Analysis of algorithms
- Randomized algorithm
- Dinic's algorithm
- Dynamic programming
- Binary search
- Blahut–Arimoto algorithm
- Edmonds–Karp algorithm
- Dijkstra's algorithm
- Sorting algorithm
- Karmarkar's algorithm
- Computational phylogenetics
- Quine–McCluskey algorithm
- Breadth-first search
- Lempel–Ziv coding
- Karatsuba algorithm
- Ford–Fulkerson algorithm
- Blossom algorithm
- Depth-first search
- Lin–Kernighan heuristic
- Online algorithm and competitive analysis
- Hopcroft–Karp algorithm
- Approximation algorithm
- Floyd–Warshall algorithm
- Ellipsoid method
- String-searching algorithm
- Prim's algorithm
- Greedy algorithm
- Bellman–Ford algorithm
- Held–Karp algorithm
- Kruskal's algorithm
- Divide-and-conquer algorithm
Further reading
About this page
| Tag | 9DMSG5HAQX |
|---|---|
| URI | m2://9DMSG5HAQX |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68W01, 68Q10 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Sardinas–Patterson algorithm
- Christofides algorithm
- Analysis of algorithms
- Randomized algorithm
- Dinic's algorithm
- Dynamic programming
- Binary search
- Blahut–Arimoto algorithm
- Edmonds–Karp algorithm
- Dijkstra's algorithm
- Sorting algorithm
- Karmarkar's algorithm
- Computational phylogenetics
- Quine–McCluskey algorithm
- Breadth-first search
- Lempel–Ziv coding
- Karatsuba algorithm
- Ford–Fulkerson algorithm
- Blossom algorithm
- Depth-first search
- Lin–Kernighan heuristic
- Online algorithm and competitive analysis
- Hopcroft–Karp algorithm
- Approximation algorithm
- Floyd–Warshall algorithm
- Ellipsoid method
- String-searching algorithm
- Prim's algorithm
- Greedy algorithm
- Bellman–Ford algorithm
- Held–Karp algorithm
- Kruskal's algorithm
- Divide-and-conquer algorithm
Special cases
- Randomized algorithm
- Viterbi algorithm
- Knuth–Bendix completion
- Depth-first search
- Approximation algorithm
- Breadth-first search
- Online algorithm and competitive analysis
- CYK algorithm
- Berlekamp–Welch algorithm
- Divide-and-conquer algorithm
- Neighbor joining
- Sorting algorithm
- Sardinas–Patterson algorithm
- Blahut–Arimoto algorithm
- Greedy algorithm
- Belief propagation decoding
- Dynamic programming
- BCJR algorithm
- Ellipsoid method
- String-searching algorithm
- Binary search