GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Main page
  • Contents
  • Current events
  • Random article
  • About Wikipedia
  • Contact us
  • Help
  • Learn to edit
  • Community portal
  • Recent changes
  • Upload file
  • Special pages
  • Search
  • Donate

This view

  • Original page
  • New address

GeezerVison is showing en.wikipedia.org — Algorithmic paradigm - Wikipedia

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

  • Backtracking
  • Branch and bound
  • Brute-force search
  • Divide and conquer
  • Dynamic programming
  • Greedy algorithm
  • Recursion
  • Prune and search

Parameterized complexity

  • Kernelization
  • Iterative compression

Computational geometry

  • Sweep line algorithms
  • Rotating calipers
  • Randomized incremental construction

References

  1. ↑ p. 702
  2. ↑ p. 9
Retrieved from "https://en.wikipedia.org/w/index.php?title=Algorithmic_paradigm&oldid=1210574096"
Category:
  • Algorithms
Hidden categories:
  • Articles with short description
  • Short description matches Wikidata
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.