Computer Algorithms, 2/e (Paperback) (計算機演算法(第二版))
Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran
- 出版商: Silicon Press
- 出版日期: 2007-11-01
- 定價: $1,390
- 售價: 9.8 折 $1,362
- 語言: 英文
- 頁數: 773
- 裝訂: Paperback
- ISBN: 0929306414
- ISBN-13: 9780929306414
-
相關分類:
Algorithms-data-structures
立即出貨 (庫存 < 4)
買這商品的人也買了...
-
$600$588 -
$980$960 -
$1,176Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
-
$836PSP: A Self-Improvement Process for Software Engineers (Hardcover)
-
$680$646 -
$880$695 -
$1,127Database System Concepts, 5/e (IE) (美國版ISBN:0072958863)
-
$150$119 -
$880$695 -
$680$578 -
$550$435 -
$680$666 -
$600$540 -
$1,200$1,176 -
$1,362Fundamentals of Data Structures in C++, 2/e (Paperback)
-
$350$298 -
$990$891 -
$600$480 -
$1,362Fundamentals of Data Structures in C, 2/e (Paperback)
-
$560$437 -
$480$379 -
$650$514 -
$1,180$932 -
$1,750$1,663 -
$2,146Introduction to Algorithms, 4/e (Hardcover)
相關主題
商品描述
Description
Latest Edition of the Classic Algorithms Text!
Brand new edition of the programming language-independent text that helped establish computer algorithms as discipline of computer science -- a thoroughly revised and updated edition. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.Computer Algorithms emphasizes:
- Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
- Examples: A wide range of examples provides students with the actual implementation of correct design.
- The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
- Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.
Computer Algorithms is appropriate as a core text for upper- and graduate-level analysis of algorithms courses.
商品描述(中文翻譯)
描述
最新版本的經典算法教材!這是一本獨立於程式語言的教材,幫助確立了計算機算法作為計算機科學學科的地位,是一本經過全面修訂和更新的教材。本書融入了最新的研究和最先進的應用,將這本經典教材帶到了現代計算機科學教育的前沿。本書的一個重要特點是其專注於設計技巧而不是個別算法。
最新版本的經典算法教材!這是一本獨立於程式語言的教材,幫助確立了計算機算法作為計算機科學學科的地位,是一本經過全面修訂和更新的教材。本書融入了最新的研究和最先進的應用,將這本經典教材帶到了現代計算機科學教育的前沿。本書的一個重要特點是其專注於設計技巧而不是個別算法。計算機算法強調:
- 設計技巧:分治法、貪婪法、動態規劃、回溯法和分支限界法通過多個例子進行了說明,每個算法都進行了全面分析。
- 例子:提供了各種例子,讓學生實際實現正確的設計。
- 最新研究:包括對概率算法和並行算法的全面介紹。
- 隨機算法的完全整合:與非隨機算法的性能進行了全面比較。《計算機算法》適用於高級和研究生級別的算法分析課程的核心教材。