Education / Algorithms
Design and Analysis of Algorithms Study Guide
Student guide to 16 classic algorithms with C code
About this project
PDF study guide and C implementations for 16 key algorithms and problems from Anany Levitin's Introduction to the Design and Analysis of Algorithms: searching, sorting, N-Queens, knapsack, Kruskal, Dijkstra, Graham scan, Miller-Rabin and LCS, organised into Basic, Moderate and High difficulty levels.
The problem
Students need a clear, worked reference for the core algorithms in a standard textbook course.
Approach
A PDF study guide with step-by-step explanations, formulas and examples for 16 algorithms, from searching and sorting to N-Queens, knapsack, Kruskal, Dijkstra, Graham scan, Miller-Rabin and LCS. The matching C programs are sorted into basic, moderate and high difficulty folders.
Results
A free study resource with C implementations. Contributions are open.
- Category
- Education / Algorithms
- Built by
- Jeyadev R
