A Programmer's Companion to Algorithm Analysis

Ernst L. Leiss

270 pages, parution le 26/10/2006

Ajouter à une liste

Indisponible

Résumé

Describes how to progress from an effective algorithm to a successful software program
Suggests ways to avoid the major problems that software engineers and programmers encounter when implementing algorithms
Explains the fundamental differences between the computational model assumed for algorithms and real architectures
Emphasizes the implications of the memory hierarchy on program efficiency
Explores the interactions among the program, compiler, and run-time support system

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 parts, the book emphasizes the concrete aspects of translating an algorithm into software that should perform based on what the algorithm analysis indicated. In the first part, the author describes the idealized universe that algorithm designers inhabit while the second part outlines how this ideal can be adapted to the real world of programming. The book explores analysis techniques, including crossover points, the influence of the memory hierarchy, implications of programming language aspects, such as recursion, and problems arising from excessively high computational complexities of solution methods. It concludes with four appendices that discuss basic algorithms; memory hierarchy, virtual memory management, optimizing compilers, and garbage collection; NP-completeness and higher complexity classes; and undecidability in practical terms.

Applying the theory of algorithms to the production of software, A Programmer's Companion to Algorithm Analysis fulfills the needs of software programmers and developers as well as students by showing that with the correct algorithm, you can achieve a functional software program.

L'auteur - Ernst L. Leiss

Ernst L. Leiss : University of Houston, Texas, USA

Sommaire

The Algorithm Side: Regularity, Predictability, and Asymptotics
- A Taxonomy of Algorithmic Complexity
- Fundamental Assumptions Underlying Algorithmic Complexity
- Examples of Complexity Analysis
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
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

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Chapman and Hall / CRC
Auteur(s)	Ernst L. Leiss
Parution	26/10/2006
Nb. de pages	270
Format	15,5 x 23,5
Couverture	Broché
Poids	380g
Intérieur	Noir et Blanc
EAN13	9781584886730
ISBN13	978-1-58488-673-0