Klassifikation von Algorithmen nach Zweck
Klassifikation nach Umsetzung
| Recursive | - | Iterative |
| Logical | - | Procedural |
| Bottom up | - | Top down |
| Serial | - | Parallel |
| Deterministic | - | Non-Deterministic |
| Exact | - | Approximate |
Klassifikation nach Paradigma
| Divide-and-conquer | divides the problem into smaller subproblems of the same type, and solve these subproblems recursively |
| Dynamic programming | remembers past results and uses them to find new results |
| Greedy | always takes the best immediate, or local, solution while finding an answer |
| Linear programming | expresses a problem as a set of linear inequalities and then attempts to maximize or minimize the inputs |
| Reduction | transforms the problem |
| Graph exploration | models problems on graphs |
| Randomized | uses a random number at least once during the computation to make a decision |
| Heuristic | uses rules of thumb |
| Genetic | numerical optimization procedure that is based on evolutionary principles such as mutation, deletion and selection |