Algorithms Illuminated -- Part 2 : Graph Algorithms and Data Structures (Paperback)
暫譯: 算法啟示錄 -- 第二部分:圖形演算法與資料結構 (平裝本)
Tim Roughgarden
- 出版商: Soundlikeyourself Publishing, LLC
- 出版日期: 2018-08-08
- 定價: $900
- 售價: 9.5 折 $855
- 語言: 英文
- 頁數: 222
- 裝訂: Paperback
- ISBN: 0999282921
- ISBN-13: 9780999282922
-
相關分類:
Algorithms-data-structures
-
相關翻譯:
算法詳解 捲2 圖算法和數據結構 (簡中版)
-
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,805The 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 -
$2,520Fundamentals of Software Architecture: A Comprehensive Guide to Patterns, Characteristics, and Best Practices (Paperback)
-
$855Algorithms Illuminated -- Part 3 : Greedy Algorithms and Dynamic Programming (Paperback)
-
$2,124Database Internals: A Deep Dive Into How Distributed Data Systems Work (Paperback)
-
$340$289 -
$2,124Software 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
相關主題
商品描述
Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes solutions to all quizzes and selected problems, and a series of YouTube videos by the author accompanies the book. Part 2 covers graph search and its applications, shortest-path algorithms, and the applications and implementation of several data structures: heaps, search trees, hash tables, and bloom filters. (Part 1 is not a prerequisite.)
商品描述(中文翻譯)
易於理解、直截了當且不依賴於特定程式語言的演算法入門書籍。書中包含所有測驗和選定問題的解答,並附有作者製作的一系列 YouTube 影片。第二部分涵蓋圖形搜尋及其應用、最短路徑演算法,以及幾種資料結構的應用與實作:堆積(heaps)、搜尋樹(search trees)、雜湊表(hash tables)和布隆過濾器(bloom filters)。(第一部分不是先修課程。)