This is an old revision of the document!
Chapter 2 - Basics of Algorithm Analysis
We have to think about how much time and how much space an algorithm will use as the size of its input(s) increases.
2.1 - Computational Tractability
Many problems involve searching through a large number of possibilities, and the algorithm is supposed to find a solution more quickly than just searching through all theoretical possibilities.
