Cover Image

A programmer's companion to algorithm analysis /

Show other versions (1)

This book details the transition from the design and analysis of an algorithm to the resulting software program. Consisting of two main 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...

Full description

Bibliographic Details
Main Author: Leiss, Ernst L., 1952-
Corporate Author: Taylor & Francis
Format: eBook
Language:English
Language Notes:English.
Published: Boca Raton : Chapman & Hall/CRC, ©2007.
Subjects:
Programming (Mathematics)
Algorithms > Data processing.
Programmation (Mathématiques)
Algorithmes > Informatique.
algorithms.
COMPUTERS > Programming > General.
Algorithms > Data processing
Civil & Environmental Engineering.
Engineering & Applied Sciences.
Operations Research.
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Foreword
  • Part 1. The algorithm side : regularity, predictability, and asymptotics. 1. A taxonomy of algorithmic complexity
  • 2. Fundamental assumptions underlying algorithmic complexity
  • 3. Examples of complexity analysis
  • Part 2. The software side : disappointments and how to avoid them. 4. Sources of disappointments
  • 5. Implications of nonuniform memory for software
  • 6. Implications of compiler and systems issues for software
  • 7. Implicit assumptions
  • 8. Implications of the finiteness of the representation of numbers
  • 9. Asymptotic complexities and the selection of algorithms
  • 10. 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.