**by Jeff Erickson**

DescriptionTable of ContentsDetailsHashtagsReport an issue ### 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 book 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

### Book Details

### Related Books

This open book is licensed under a Creative Commons License (CC BY). You can download Algorithms ebook for free in PDF format (25.7 MB).

Chapter 1

Recursion

Chapter 2

Backtracking

Chapter 3

Dynamic Programming

Chapter 4

Greedy Algorithms

Chapter 5

Basic Graph Algorithms

Chapter 6

Depth-First Search

Chapter 7

Minimum Spanning Trees

Chapter 8

Shortest Paths

Chapter 9

All-Pairs Shortest Paths

Chapter 10

Maximum Flows & Minimum Cuts

Chapter 11

Applications of Flows and Cuts

Chapter 12

NP-Hardness

Title

Algorithms

Subject

Computer Science

Publisher

Self-publishing

Published

2019

Pages

472

Edition

1

Language

English

ISBN13 Digital

9781792644832

ISBN10 Digital

1792644833

PDF Size

25.7 MB

License

This book is a modern guide for all C++ programmers to learn Threading Building Blocks (TBB). Written by TBB and parallel programming experts, this book reflects their collective decades of experience in developing and teaching parallel programming with TBB, offering their insights in an approachable manner. Throughout the book the authors present ...

This book bridges the gap between playing with robots in school and studying robotics at the upper undergraduate and graduate levels to prepare for careers in industry and research. Robotic algorithms are presented formally, but using only mathematics known by high-school and first-year college students, such as calculus, matrices and probability. ...

The overarching aim of this book is to present self-contained theory and algorithms for investigation and prediction of electric demand peaks. A cross-section of popular demand forecasting algorithms from statistics, machine learning and mathematics is presented, followed by extreme value theory techniques with examples.In order to achieve carbon t...

Learn how graph algorithms can help you leverage relationships within your data to develop intelligent solutions and enhance your machine learning models. With this practical guide, developers and data scientists will discover how graph analytics deliver value, whether they're used for building dynamic network models or forecasting real-world ...

If you're a student studying computer science or a software developer preparing for technical interviews, this practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials.
By emphas...

This book is assembled from lectures given by the author over a period of 10 years at the School of Computing of DePaul University. The lectures cover multiple classes, including Analysis and Design of Algorithms, Scientific Computing, Monte Carlo Simulations, and Parallel Algorithms. These lectures teach the core knowledge required by any scientis...