Leiss Ernst I. A Programmer’s Companion to Algorithm Analysis

Chapman & Hall/CRC, 2007. — 253 p.A Taxonomy of Algorithmic Complexity
Fundamental Assumptions Underlying Algorithmic Complexity
Examples of Complexity Analysis
Sources of Disappointments
Implications of Nonuniform Memory for Software
Implications of Compiler and Systems Issues for Software
Implicit Assumptions
Implications of the Finiteness of the Representation of Numbers
Asymptotic Complexities and the Selection of Algorithms
Infeasibility and Undecidability: Implications for Software Development
Appendix I: Algorithms Every Programmer Should Know
Appendix II: Overview of Systems Implicated in Program Analysis
Appendix III: NP-Completeness and Higher Complexity Classes