Definition
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.
Related concepts
AbstractionAlgorithmArray (data structure)Associative arrayBacktrackingBinary searchBinary search treeBranch and boundBreadth-first searchBrute-force searchComputer programData structureDepth-first searchDivide-and-conquer algorithmDynamic programmingFenwick treeFold (higher-order function)Graph (abstract data type)Graph traversalGreedy algorithmHash functionHash tableHeap (data structure)Iterative compressionKernelizationLinked listList of algorithmsList of data structuresMinimaxOnline algorithmParadigmPrune and searchQueue (abstract data type)Randomized algorithmRecursion (computer science)Root-finding algorithmRotating calipersSegment treeSorting algorithmStack (abstract data type)Streaming algorithmString-searching algorithmString (computer science)Sweep line algorithmTopological sortingTree (abstract data type)Trie
7 concepts already in your glossary