An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of
algorithms. An algorithmic
paradigm
In science and philosophy, a paradigm () is a distinct set of concepts or thought patterns, including theories, research methods, postulates, and standards for what constitute legitimate contributions to a field.
Etymology
''Paradigm'' comes f ...
is an
abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a
computer program.
p. 9
/ref>
List of well-known paradigms
General
* Backtracking
* Branch and bound
*Brute-force search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the soluti ...
*Divide and conquer
Divide and rule policy ( la, divide et impera), or divide and conquer, in politics and sociology is gaining and maintaining power divisively. Historically, this strategy was used in many different ways by empires seeking to expand their terr ...
* Dynamic programming
* Greedy algorithm
* Prune and search
Parameterized complexity
* Kernelization
* Iterative compression In computer science, iterative compression is an algorithmic technique for the design of fixed-parameter tractable algorithms, in which one element (such as a vertex of a graph) is added to the problem in each step, and a small solution for the pr ...
Computational geometry
* Sweep line algorithms
* Rotating calipers
* Randomized incremental construction
In common usage, randomness is the apparent or actual lack of pattern or predictability in events. A random sequence of events, symbols or steps often has no order and does not follow an intelligible pattern or combination. Individual rando ...
References
{{Algorithmic paradigms
Algorithms