Main Page

From The Algorithm Design Manual Solution Wiki
Redirect page
Jump to navigation Jump to search

The Wiki is an experiment, a grass-roots effort to create an answer key to aid self-study with the third edition of Steven Skiena's The Algorithm Design Manual. Students and other readers are encouraged to contribute hints and answers to all odd-numbered problems in the book, or expand/improve the solution contributed by others.

Please do not use this resource to cheat on your class homework. Recognize that no authority certifies the correctness of these solutions; they could well have been submitted by the idiot who sits in the back row of your class. Also recognize that other students in your class have equal access to these solutions, and it is typically easy for professors to recognize when two students submit the same solution.


  1. Introduction to Algorithms
  2. Algorithm Analysis
  3. Data Structures
  4. Sorting
  5. Divide and Conquer
  6. Hashing and Randomized Algorithms
  7. Graph Traversal
  8. Weighted Graph Algorithms
  9. Combinatorial Search
  10. Dynamic Programming
  11. NP-Completeness
  12. Dealing with Hard Problems

Getting started

Mediawiki General