Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming

Roughgarden, Tim

  • 出版商: Soundlikeyourself Publishing, LLC
  • 出版日期: 2019-05-09
  • 定價: $900
  • 售價: 9.5$855
  • 貴賓價: 9.0$810
  • 語言: 英文
  • 頁數: 230
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 0999282948
  • ISBN-13: 9780999282946
  • 相關分類: Algorithms-data-structures
  • 相關翻譯: 算法詳解 捲3 貪心算法和動態規劃 (簡中版)
  • 立即出貨 (庫存 < 3)

買這商品的人也買了...

相關主題

商品描述

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).

商品描述(中文翻譯)

演算法是計算機科學的核心。它們的應用範圍從網絡路由和計算基因組學到公鑰加密和機器學習。學習演算法可以使您成為一個更好的程序員,一個更清晰的思考者,以及技術面試的大師。《演算法照明》是一本對於至少有一點編程經驗的任何人來說都能理解的入門書。該書強調整體概念和概念理解,而不是低層次實現和數學細節,就像一系列一對一課程中專業演算法導師會說的內容一樣。第三部分涵蓋了貪婪演算法(調度、最小生成樹、聚類、哈夫曼編碼)和動態規劃(背包問題、序列對齊、最短路徑、最優搜索樹)。