• https://doi.org/10.1017/cbo9780511804793.018Copy DOI Icon

Advanced Algorithms

  • Mar 26, 2007
  • Michael Mcmillan
Show More
  • Abstract
  • Literature Map
  • Similar Papers
Abstract

In this chapter, we look at two advanced topics: dynamic programming and greedy algorithms. Dynamic programming is a technique that is often considered to be the reverse of recursion—a recursive solution starts at the top and breaks the problem down solving all small problems until the complete problem is solved; a dynamic programming solution starts at the bottom, solving small problems and combining them to form an overall solution to the big problem.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.