A Programmer's Companion to Algorithm Analysis Book

PART 1 THE ALGORITHM SIDE: REGULARITY, PREDICTABILITY, AND ASYMPTOTICS A Taxonomy of Algorithmic Complexity Fundamental Assumptions Underlying Algorithmic Complexity Examples of Complexity Analysis PART 2 THE SOFTWARE SIDE: DISAPPOINTMENTS AND HOW TO AVOID THEM 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 PART 3 CONCLUSION Appendix I: Algorithms Every Programmer Should Know Appendix II: Overview of Systems Implicated in Program Analysis Appendix III: NP-Completeness and Higher Complexity Classes Appendix IV: Review of Undecidability BIBLIOGRAPHY INDEX