Algorithms
内容简介
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.
......(更多)
作者简介
Jeff Erickson is a professor of computer science at the University of Illinois at Urbana-Champaign, where he has been a faculty member since 1998. His research interests lie at the intersection of algorithm design and discrete mathematics, especially for problems involving geometry, topology, graphs, and optimization.
Jeff's father used to keep an “electric hammer” in his office. It was a regular hammer with a battery, an LED, and a toggle switch that he'd built into the handle. Whenever someone would ask how it worked, he would flip the switch, turning the LED on, and say “There. Now it's on.”
......(更多)
目录
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)
......(更多)
读书文摘
We're done: 15*25-34*11=1, so x=15 and y=-34
编写递归代码时最重要的有以下三点： * 递归总有一个最简单的情况——方法的第一条语句总是一个包含 return 的条件语句。 * 递归调用总是去尝试解决一个规模更小的子问题，这样递归慈恩那个收敛到最简单的情况。 * 递归调用的父问题和尝试解决的子问题之间不应该有交集。
......(更多)
