A Programmer's Companion to Algorithm Analysis
1st Edition
Published on 26. September 2006
255 pages
978-1-040-17097-7 (ISBN)
Description
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
Consisting of two main complementary
Reviews / Votes
"... an interesting book which addresses some of the issues which inhibit the development of perfect-world software. ... In my opinion, this book should be on the bookshelf of anyone aspiring to become a good programmer. ... this book would be a good auxiliary book in courses on algorithms, especially those intended for students intent on becoming software developers. Similarly with an advanced programming-type course. The book also would work well for self-study."-Dean Kelley, SIGACT News, Vol. 40, No. 2
More details
Edition
1. Auflage
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
ISBN-13
978-1-040-17097-7 (9781040170977)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Ernst L. Leiss
A Programmer's Companion to Algorithm Analysis
Book
08/2017
1st Edition
CRC Press
€290.17
Shipment within 10-20 days
Ernst L. Leiss
A Programmer's Companion to Algorithm Analysis
Book
09/2006
1st Edition
Chapman & Hall/CRC
€109.00
Shipment within 15-20 days
Person
Content
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.
Bibliography. Index.
