Algorithms
Table of Contents
- Preamble
- Introduction
- Mathematical Background
- Divide and Conquer
- Randomization
- Backtracking
- Dynamic Programming
- Greedy Algorithms
- Hill Climbing
- Unweighted Graph Algorithms
- Distance approximations
- Appendix A: Ada Implementation
- Appendix B: Sources
Contributors
Macneil Shonle A large portion of my contributions here come from lectures made by [Impagliazzo] at UCSD. I like this project because it gives me a chance to explain algorithms in the way that I finally understood them
Matthew Wilson I typed in an outline after finishing a graduate algorithms course. M. Shonle has taken this textbook and really made it something great.
Martin Krischik I supplied the Ada examples for the algorithms. You never know if an algorithm works until you have actually implemented it.
See also the Sources list for contributions used with permission.