Introduction to Algorithms, 3/e (Hardcover)
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
- 出版商: MIT
- 出版日期: 2009-09-01
- 售價: $1,650
- 貴賓價: 9.8 折 $1,617
- 語言: 英文
- 頁數: 1312
- 裝訂: Hardcover
- ISBN: 0262033844
- ISBN-13: 9780262033848
-
相關分類:
Algorithms-data-structures 資料結構與演算法
-
相關翻譯:
算法導論, 3/e (Introduction to Algorithms, 3/e) (簡中版)
-
其他版本:
Introduction to Algorithms, 3/e (IE-Paperback)
銷售排行:
🥇 2021/3 英文書 銷售排行 第 1 名
🥇 2021/2 英文書 銷售排行 第 1 名
🥉 2021/1 英文書 銷售排行 第 3 名
🥈 2020 年度 英文書 銷售排行 第 2 名
🥈 2020/8 英文書 銷售排行 第 2 名
🥉 2020/7 英文書 銷售排行 第 3 名
立即出貨
買這商品的人也買了...
-
$620$558 -
$1,390$1,362 -
$1,390$1,362 -
$790$751 -
$750$713 -
$940$700 -
$1,680$1,596 -
$1,650$1,568 -
$2,860$2,717 -
$850$808 -
$1,200$1,140 -
$1,500$1,425 -
$780$616 -
$1,650$1,617 -
$700$553 -
$3,030$2,879 -
$1,420$1,349 -
$450$356 -
$3,550$3,373 -
$1,300$1,235 -
$580$452 -
$880$792 -
$1,250$1,188 -
$1,680$1,596 -
$1,780$1,744
相關主題
商品描述
"Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance."--Daniel Spielman, Department of Computer Science, Yale University
(Daniel Spielman )