Algorithmic paradigm
 | This article or section is undergoing 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 actively editing this article or section, you can replace this template with {{in use|5 minutes}}.
This article was last edited by Lembit Staan (talk | contribs) 9 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. [1][2] Typical examples of algorithmic paradigms include the greedy algorithm in optimization problems, plane sweep in computational geometry, dynamic programming and divide and conquer algorithms.
References
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |