Algorithms Illuminated -- Part 3 : Greedy Algorithms and Dynamic Programming (Paperback)
Roughgarden, Tim
- 出版商: Soundlikeyourself Publishing, LLC
- 出版日期: 2019-05-09
- 定價: $900
- 售價: 9.5 折 $855
- 語言: 英文
- 頁數: 230
- 裝訂: Quality Paper - also called trade paper
- ISBN: 0999282948
- ISBN-13: 9780999282946
-
相關分類:
Algorithms-data-structures
-
相關翻譯:
算法詳解 捲3 貪心算法和動態規劃 (簡中版)
-
Part 1 : The Basics Part 2 : Graph Algorithms and Data Structures Part 3 : Greedy Algorithms and Dynamic Programming Part 4 : Algorithms for NP-Hard Problems
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
$580$458 -
$1,672The Art of Readable Code (Paperback)
-
$2,800$2,660 -
$360$281 -
$1,078Data Structures and Algorithm Analysis in C++, 4/e (IE-Paperback)
-
$1,800$1,710 -
$500$390 -
$690$621 -
$855Algorithms Illuminated -- Part 1 : The Basics (Paperback)
-
$1,350$1,283 -
$855Algorithms Illuminated -- Part 2 : Graph Algorithms and Data Structures (Paperback)
-
$2,240Fundamentals of Software Architecture: A Comprehensive Guide to Patterns, Characteristics, and Best Practices (Paperback)
-
$2,124Database Internals: A Deep Dive Into How Distributed Data Systems Work (Paperback)
-
$340$289 -
$1,888Software Engineering at Google: Lessons Learned from Programming Over Time (Paperback)
-
$250算法詳解 捲2 圖算法和數據結構
-
$1,900$1,805 -
$855Algorithms Illuminated -- Part 4 : Algorithms for NP-Hard Problems (Paperback)
-
$680$537 -
$480$379 -
$980$774 -
$1,710System Design Interview – An Insider's Guide: Volume 2 (Paperback)
-
$356算法詳解 捲3 貪心算法和動態規劃
-
$407算法詳解(捲4)——NP-Hard問題算法
-
$2,250$2,138
相關主題
商品描述
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).