Jump to content

Algorithmic paradigm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by AdaHephais (talk | contribs) at 11:58, 23 December 2023 (Internal link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

General

Parameterized complexity

Computational geometry

References