Difference between revisions of "Main Page"
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
| − | + | ==Chapters== | |
| + | |||
| + | #[[Chapter 1|Introduction to Algorithms]] | ||
| + | #[[Chapter 2|Algorithm Analysis]] | ||
| + | #[[Chapter 3|Data Structures]] | ||
| + | #[[Chapter 4|Sorting]] | ||
| + | #[[Chapter 5|Divide and Conquer]] | ||
| + | #[[Chapter 6|Hashing and Randomized Algorithms]] | ||
| + | #[[Chapter 7|Graph Traversal]] | ||
| + | #[[Chapter 8|Weighted Graph Algorithms]] | ||
| + | #[[Chapter 9|Combinatorial Search]] | ||
| + | #[[Chapter 10|Dynamic Programming]] | ||
| + | #[[Chapter 11|NP-Completeness]] | ||
| + | #[[Chapter 12|Dealing with Hard Problems]] | ||
| + | |||
== Getting started == | == Getting started == | ||
Revision as of 18:00, 1 October 2020
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.
Chapters
- Introduction to Algorithms
- Algorithm Analysis
- Data Structures
- Sorting
- Divide and Conquer
- Hashing and Randomized Algorithms
- Graph Traversal
- Weighted Graph Algorithms
- Combinatorial Search
- Dynamic Programming
- NP-Completeness
- Dealing with Hard Problems
Getting started
- Editing
- Configuration
- Mediawiki General
- Questions
- The Admin (editing fixes for the problems)
- Steven Skiena (for additional hints and algorithm magic)
