This is an old revision of the document!
Table of Contents
Chapter 2 - Basics of Algorithm Analysis
Section 2.1 - Computational Tractability
This section begins by outlining some goals in how we will diagnose themes and design principles surrounding algorithms. However, the focus then shifts to the concept of efficiency. As 2.1 progresses, the author takes logical steps towards a working definition of efficiency. We desire it in our algorithms, and we need a careful definition of it such that we can achieve it in our problem-solving as we move forward.
As a Math major, I like that the focus shifted to the mathematics behind efficiency. It truly drew me to the subject matter. The author comes to a concrete definition of efficiency focusing on the idea of a polynomial runtime. This concept was a little confusing in class but is much clearer now after reading about how it works. I found it striking that such a qualitative idea such as algorithm efficiency could be reduced down to a simple quantitative checking process. I would rate the readability of this section at 10/10.
