Algorithms

Douban
Algorithms

Inscrivez ou connectez-vous pour évaluer cette œuvre ou l'ajouter à votre collection.

ISBN: 9781792644832
écrit par: Jeff Erickson
édition: Independently published
date de publication: 2019 -6
reliure: Paperback
prix: USD 27.50
nombre de pages: 472

/ 10

2 évaluations

Pas assez d'évaluations
Acheter ou emprunter

Jeff Erickson   

résumé

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.

contents

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)

commentaires
avis
笔记