Jeff Erickson - Algorithms

[tetox]

Hidden Content

Give reaction to this post to see the hidden content.

Book: Algorithms
Author(s): Jeff Erickson.
Publisher: Independently published
Tags: Greedy Algorithms, Graph Algorithms, Dynamic Programming.
Year: 1st Edition (June 13, 2019)
Print Length: 472 pages
Format: PDF (True)
Language: English
ISBN-10: 1792644833
ISBN-13: 9781792644832
Size: 16.7 MB (RAR)

Book Description
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.

Table of Contents

• 0 Introduction
• 1 Recursion
• 2 Backtracking
• 3 Dynamic Programming
• 4 Greedy Algorithms
• 5 Basic Graph Algorithms
• 6 Depth-First Search
• 7 Minimum Spanning Trees
• 8 Shortest Paths
• 9 All-Pairs Shortest Paths
• 10 Maximum Flows & Minimum Cuts
• 11 Applications of Flows and Cuts
• 12 NP-Hardness
• Index
• Index of People
• Index of Pseudocode
• Image Credits
• Colophon

Hidden Content

Give reaction to this post to see the hidden content.

Thanks to the one who initially shared the file.

Edited February 22, 2020 by Bad Karma
Dead links removed