Algorithmic paradigm
 | This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This article was last edited by David Eppstein (talk | contribs) 8 years ago. (Update timer) |
An algorithmic paradigm, algorithm design paradigm, algorithmic technique, or algorithmic strategy is a generic method or approach which underlies the design of a class of algorithms. It and an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program. [1][2] Typical examples of algorithmic paradigms include the greedy algorithm in optimization problems, plane sweep in computational geometry, dynamic programming, prune and search, and divide and conquer algorithms.
References
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |