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

Roughgarden, Tim

  • 出版商: Soundlikeyourself Publishing, LLC
  • 出版日期: 2019-05-09
  • 售價: $760
  • 貴賓價: 9.5$722
  • 語言: 英文
  • 頁數: 230
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 0999282948
  • ISBN-13: 9780999282946
  • 相關分類: Algorithms-data-structures 資料結構與演算法

立即出貨 (庫存 < 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).