Until now, no other book examined the gap between the theory of algorithms and the production of software programs. Focusing on practical issues, A Programmer's Companion to Algorithm Analysis carefully details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main complementary

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. Appendix IV: Review of Undecidability.
Bibliography. Index.