Algorithms

豆瓣
Algorithms

登入後可管理標記收藏

ISBN: 9781792644832
作者: Jeff Erickson
出版社: Independently published
發行時間: 2019 -6
價格: USD 27.50
頁數: 472

/ 10

2 個評分

評分人數不足
借閱或購買

Jeff Erickson   

簡介

Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This textbook is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the problem-solving process. The book includes important classical examples, hundreds of battle-tested exercises, far too many historical digressions, and exaclty four typos. Jeff Erickson is a computer science professor at the University of Illinois, Urbana-Champaign; this book is based on algorithms classes he has taught there since 1998.

目錄

Introduction (20 pages)
Recursion (50 pages)
Backtracking (26 pages)
Dynamic Programming (62 pages)
Greedy Algorithms (28 pages)
Basic Graph Algorithms (38 pages)
Depth-First Search (32 pages)
Minimum Spanning Trees (16 pages)
Shortest Paths (36 pages)
All-Pairs Shortest Paths (18 pages)
Maximum Flows & Minimum Cuts (26 pages)
Applications of Flows and Cuts (26 pages)
NP-Hardness (50 pages)

短評
評論
筆記