**Algorithms**

by Jeff Erickson

**Publisher**: University of Illinois at Urbana-Champaign 2009**Number of pages**: 765

**Description**:

This course packet includes lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois at Urbana-Champaign. For the most part, these notes assume that the reader has mastered the material covered in the first two years of a typical undergraduate computer science curriculum.

Download or read it online for free here:

**Download link**

(20MB, PDF)

## Similar books

**Randomized Algorithms**

by

**Wolfgang Merkle**-

**ESSLLI**

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.

(

**5656**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**6429**views)

**Data Structures and Algorithms: Annotated Reference with Examples**

by

**Granville Barnett, Luca Del Tongo**-

**DotNetSlackers**

The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.

(

**11692**views)

**Data Structures and Algorithms**

by

**John Morris**

The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.

(

**8881**views)