2. Algorithms

Algorithms are one of the two building blocks of a program, the other being data structures. An algorithm is a recipe for making a program or a component of a program. Having not only of a selection of standard algorithms but also knowing their usefulness and how to evaluate the efficiency of your own algorithms is essential to writing good programs.

Many data structures have associated algorithms for working on that particular data structure (e.g. deletion from a heap). For descriptions of these, see the Data Structures page.

  1. Efficiency of algorithms
  2. Recursion vs. iteration
  3. Dynamic programming
  4. Sorting
  5. Searching
  6. Graphs
  7. Shortest paths
  8. Matching
  9. Network flow
  10. General tricks

[Prev] [Next] [Up]

Last updated Sun Nov 28 22:04:38.0000000000 2004. Copyright Bruce Merry (bmerry '@' gmail dot. com).