| 词条 | Algorithmic paradigm |
| 释义 |
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] Examples of algorithmic paradigms include the greedy algorithm in optimization problems, dynamic programming, prune and search, and divide and conquer algorithms. More specialized algorithmic paradigms used in parameterized complexity include kernelization and iterative compression. In computational geometry, additional algorithmic paradigms include sweep line algorithms, rotating calipers, and randomized incremental construction. References1. ^[https://books.google.com/books?id=M2viBQAAQBAJ&pg=PA702 p. 702] {{algorithm-stub}}2. ^[https://books.google.com/books?id=McPJt_eBgnoC&pg=SA1-PA9 p. 9] 1 : Algorithms |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。