Foundations of Algorithms Using C++ Pseudocode, 3/e (Hardcover)
Richard Neapolitan
- 出版商: Jones and Bartlett
- 出版日期: 2003-07-29
- 售價: $1,127
- 語言: 英文
- 頁數: 500
- 裝訂: Hardcover
- ISBN: 0763723878
- ISBN-13: 9780763723873
-
相關分類:
C++ 程式語言、Algorithms-data-structures
已過版
買這商品的人也買了...
-
$2,580$2,451 -
$970Introduction to Algorithms, 2/e
-
$780$741 -
$350$277 -
$590$466 -
$820$804 -
$750$675 -
$560$504 -
$480$379 -
$750$593 -
$780$616 -
$450$383 -
$490$417 -
$760$646 -
$490$382 -
$620$490 -
$1,176Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
-
$780$616 -
$480$408 -
$650$507 -
$399$339 -
$2,480$2,356 -
$890$757 -
$600$474 -
$600$540
相關主題
商品描述
Description:
After Foundations of Algorithms using C++ Pseudocode, Third Edition introduces students to algorithms and analysis of algorithms in Chapter 1, the authors have developed separate chapters on the divide-and-conquer approach, dynamic programming, greedy algorithms, backtracking algorithms, and branch-and-bound algorithms. Immediately after, the author's explore analysis of problems, and in particular, a chapter on analyzing the sorting problem followed by one on analyzing the searching problem. Following this progression, the authors introduce the theory of NP in a rigorous but yet intuitive, lucid fashion. It is at this point that the book then takes a shift in pedagogy and presents a chapter that is concerned with solving a certain type of problem rather than algorithms that share a common technique. Specifically, numerical algorithms are discussed, as well as the inclusion of the new polynomial-time algorithm for determining whether a number is prime. Finally, the authors provide a final chapter concerning parallel algorithms and applications to cryptography.
Table of Contents:
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 ProblemChapter 8: More Computational Complexity: The Searching Problem
Chapter 9: Computational Complexity and Interactability: An Introduction to the Theory of NPChapter 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
References