Algorithmic paradigm
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by David Eppstein (talk | contribs) at 08:18, 27 February 2024 (Reverted edit by 197.28.224.21 (talk) to last version by David Eppstein). The present address (URL) is a permanent link to this version.Revision as of 08:18, 27 February 2024 by David Eppstein (talk | contribs) (Reverted edit by 197.28.224.21 (talk) to last version by David Eppstein)
Technique or strategy underlying a variety of algorithms
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 is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.[1] [2]
List of well-known paradigms
[edit ]General
[edit ]- Backtracking
- Branch and bound
- Brute-force search
- Divide and conquer
- Dynamic programming
- Greedy algorithm
- Recursion
- Prune and search