**A Practical Introduction to Data Structures and Algorithm Analysis**

by Clifford A. Shaffer

**Publisher**: Virginia Tech 2010**ISBN/ASIN**: 0130284467**Number of pages**: 638

**Description**:

A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the data structure that will best solve a particular problem.

Download or read it online for free here:

**Download link**

(2MB, PDF)

## Similar books

**Efficient Algorithms for Sorting and Synchronization**

by

**Andrew Tridgell**-

**samba.org**

This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.

(

**11948**views)

**Design and Analysis of Computer Algorithms**

by

**David M. Mount**-

**University of Maryland**

The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.

(

**16305**views)

**Vector Models for Data-Parallel Computing**

by

**Guy Blelloch**-

**The MIT Press**

Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.

(

**10199**views)

**Algorithms**

by

**Jeff Erickson**-

**University of Illinois at Urbana-Champaign**

These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.

(

**15568**views)