nitrece/algorithm-design: An Algorithm is a sequence of steps to solve a problem. · GitHub

Name		Name	Last commit message	Last commit date
Notes		Notes
Slides		Slides
.gitignore		.gitignore
01. Introduction.pdf		01. Introduction.pdf
02. The Complexity of Algorithms and the Lower Bounds of Problems.pdf		02. The Complexity of Algorithms and the Lower Bounds of Problems.pdf
03. The Theory of NP-Completeness.pdf		03. The Theory of NP-Completeness.pdf
04. The Greedy Method.pdf		04. The Greedy Method.pdf
05. The Divide-and-Conquer Strategy.pdf		05. The Divide-and-Conquer Strategy.pdf
06. The Searching Strategies.pdf		06. The Searching Strategies.pdf
07. Prune-and-Search.pdf		07. Prune-and-Search.pdf
09. Approximation Algorithms.pdf		09. Approximation Algorithms.pdf
10. Amortized Analysis.pdf		10. Amortized Analysis.pdf
11. Randomized Algorithms.pdf		11. Randomized Algorithms.pdf
LICENSE		LICENSE
README.md		README.md