Externally indexed torrent

If you are the original uploader, contact staff to have it moved to your account

Textbook in CHM format

Foundations of Algorithms Using C   Pseudocode, Third Edition offers a well-balanced presentation on designing algorithms, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
Foundations of Algorithms Using C   Pseudocode, Third Edition
Chapter 1 - Algorithms—Efficiency, 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—The Sorting Problem
Chapter 8 - More Computational Complexity—The Searching Problem
Chapter 9 - Computational Complexity and Interactability—An 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—With Applications to Analysis of Recursive Algorithms
Appendix C - Data Structures for Disjoint Sets
List of Figures
List of Tables
List of Algorithms, Examples, and Theorems
List of Sidebars