This is an old revision of the document!
Table of Contents
Chapter 2
This chapter explains how to analyze algorithms by measuring how their resource requirements scale with increasing input size.
Section 1: Computational Tractability
We want to find efficient algorithms, but what does efficient mean? We need to be more specific than just saying it runs fast or its better than brute-force search so we will consider an algorithm efficient if it has a polynomial worst-case running time. This means that for an input of size N, the worst-case running time is bounded by cN^d, where c and d are positive constants.
Readability: 8
Section 2: Asymptotic Order of Growth
- Summary of this section
- Insights I have
- The questions I have
- How readable section was
