Algorithms Illuminated: Omnibus Edition (Hardcover)
Roughgarden, Tim
- 出版商: Cambridge
- 出版日期: 2022-09-15
- 售價: $2,500
- 貴賓價: 9.5 折 $2,375
- 語言: 英文
- 頁數: 690
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 0999282980
- ISBN-13: 9780999282984
-
相關分類:
Algorithms-data-structures
立即出貨 (庫存=1)
買這商品的人也買了...
-
$1,362Fundamentals of Data Structures in C++, 2/e (Paperback)
-
$1,362Fundamentals of Data Structures in C, 2/e (Paperback)
-
$1,560Programming: Principles and Practice Using C++ (Paperback)
-
$1,200$1,140 -
$1,156An Introduction to the Analysis of Algorithms, 2/e (Hardcover)
-
$2,790$2,651 -
$1,380$1,311 -
$1,330$1,303 -
$2,380Numerical Algorithms: Methods for Computer Vision, Machine Learning, and Graphics (Hardcover)
-
$5,180$4,921 -
$1,560$1,529 -
$1,274Introduction to the Design and Analysis of Algorithms (Paperback)
-
$1,530Secrets of the JavaScript Ninja, 2/e (Paperback)
-
$2,980$2,831 -
$401深度學習原理與實踐
-
$1,580$1,548 -
$2,400$2,280 -
$1,254Algorithms for Convex Optimization (Paperback)
-
$380$300 -
$1,380$1,352 -
$2,146Introduction to Algorithms, 4/e (Hardcover)
-
$2,010$1,910 -
$560$442 -
$880$660 -
$354$336
商品描述
In Algorithms Illuminated, Tim Roughgarden teaches the basics of algorithms in the most accessible way imaginable. This Omnibus Edition contains the complete text of Parts 1-4, with thorough coverage of asymptotic analysis, graph search and shortest paths, data structures, divide-and-conquer algorithms, greedy algorithms, dynamic programming, and NP-hard problems. Hundreds of worked examples, quizzes, and exercises, plus comprehensive online videos, help readers become better programmers; sharpen their analytical skills; learn to think algorithmically; acquire literacy with computer science's greatest hits; and ace their technical interviews.
商品描述(中文翻譯)
在《算法揭秘》中,Tim Roughgarden以最易理解的方式教授算法的基礎知識。這本綜合版包含了第1至第4部分的完整內容,詳細介紹了漸進分析、圖搜索和最短路徑、數據結構、分治算法、貪婪算法、動態規劃和NP困難問題。數百個實例、測驗和練習題,以及全面的線上視頻,幫助讀者成為更好的程式設計師;提升他們的分析能力;學會以算法思維;熟悉計算機科學的經典案例;並在技術面試中表現出色。