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]
YouTube Encyclopedic
-
1/3Views:5 64415 61063 145
-
Secrets of Algorithmic Paradigms [Introduction] | Study Algorithms
-
Divide and Conquer - An Algorithm Design Paradigm
-
Programming Paradigms in 6 Minutes
Transcription
List of well-known paradigms
General
- Backtracking
- Branch and bound
- Brute-force search
- Divide and conquer
- Dynamic programming
- Greedy algorithm
- Recursion
- Prune and search
Parameterized complexity
Computational geometry
References
This page was last edited on 27 February 2024, at 08:18