This is a test
- 255 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
A Programmer's Companion to Algorithm Analysis
Book details
Table of contents
Citations
About This Book
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
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access A Programmer's Companion to Algorithm Analysis by Ernst L. Leiss in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Games. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- Front Cover
- Preface
- Contents
- Foreword
- Part 1. The Algorithm Side: Regularity, Predictability, and Asymptotics
- Chapter 1. A Taxonomy of Algorithmic Complexity
- Chapter 2. Fundamental Assumptions Underlying Algorithmic Complexity
- Chapter 3. Examples of Complexity Analysis
- Part 2. The Software Side: Disappointments and How to Avoid Them
- Chapter 4. Sources of Disappointments
- Chapter 5. Implications of Nonuniform Memory for Software
- Chapter 6. Implications of Compiler and Systems Issues for Software
- Chapter 7. Implicit Assumptions
- Chapter 8. Implications of the Finiteness of the Representation of Numbers
- Chapter 9. Asymptotic Complexities and the Selection of Algorithms
- Chapter 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
- Back Cover