Foundations of Algorithms Using C++ Pseudocode, Third Edition

This book offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity that is accessible to mainstream computer science students who have a background in college algebra and discrete structures.

Text offers a presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. For computer science students with a background in college algebra and discrete structures. Includes a new section on data compression using Huffman code, and a new chapter on numerical algorithms. DLC: Algorithms.

Table of Contents
Preface
Chapter 1 – Algorithms??fficiency, Analysis, and Order
Chapter 2 – Divide-and-Conquer
Chapter 3 – Dynamic Programming
Chapter 4 – The Greedy Approach
Chapter 5 – Backtracking
Chapter 6 – Branch-and-Bound
Chapter 7 – Introduction to Computational Complexity??he Sorting Problem
Chapter 8 – More Computational Complexity??he Searching Problem
Chapter 9 – Computational Complexity and Interactability??n Introduction to the Theory of NP
Chapter 10 – Number-Theoretic Algorithms
Chapter 11 – Introduction to Parallel Algorithms
Appendix A – Review of Necessary Mathematics
Appendix B – Solving Recurrence Equations??ith Applications to Analysis of Recursive Algorithms
Appendix C – Data Structures for Disjoint Sets
References
Index
List of Figures
List of Tables
List of Algorithms, Examples, and Theorems
List of Sidebars

Download: http://mymegafiles.com/download.php?id=4A9DCF8C1