Algorithmic paradigm

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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

[edit | edit source]

General

[edit | edit source]

Parameterized complexity

[edit | edit source]

Computational geometry

[edit | edit source]

References

[edit | edit source]