Algorithmic paradigm (nonfiction): Difference between revisions
(Created page with "An '''algorithmic paradigm''', '''algorithm design paradigm''', '''algorithmic technique''', or '''algorithmic strategy''' is a generic method or approach which underlies the...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
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 [[Algorithm (nonfiction)|algorithms]]. | 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 [[Algorithm (nonfiction)|algorithms]]. | ||
It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program. | It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a [[Computer program (nonfiction)|computer program]]. | ||
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. | 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. | ||
| Line 10: | Line 10: | ||
<gallery> | <gallery> | ||
File:Greedy algorithm 36 cents.svg|link=Greedy algorithm (nonfiction)|September 5, 2018: New study of algorithmic paradigms finds that [[Greedy algorithm (nonfiction)|Greedy algorithms]] are studied more often than other algorithmic paradigms. | |||
</gallery> | </gallery> | ||
| Line 22: | Line 23: | ||
* [[Algorithm (nonfiction)]] | * [[Algorithm (nonfiction)]] | ||
* [[Computer program (nonfiction)]] | |||
* [[Mathematics (nonfiction)]] | * [[Mathematics (nonfiction)]] | ||
Latest revision as of 10:11, 3 September 2018
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 is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.
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.
In the News
September 5, 2018: New study of algorithmic paradigms finds that Greedy algorithms are studied more often than other algorithmic paradigms.
Fiction cross-reference
Nonfiction cross-reference
External links:
- Algorithmic paradigm @ Wikipedia