**Algorithms and Data Structures**

by Niklaus Wirth

**Publisher**: Prentice Hall 1985**ISBN/ASIN**: 0130220051**ISBN-13**: 9780130220059**Number of pages**: 212

**Description**:

The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.

Download or read it online for free here:

**Download link**

(1.2MB, PDF)

## Similar books

**Introduction to Design Analysis of Algorithms**

by

**K. Raghava Rao**-

**Smashwords**

This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.

(

**4141**views)

**Lecture Notes on Bucket Algorithms**

by

**Luc Devroye**-

**Birkhauser**

In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.

(

**6771**views)

**Open Data Structures: An Introduction**

by

**Pat Morin**-

**AU Press**

Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

(

**9702**views)

**A=B**

by

**Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger**-

**AK Peters, Ltd.**

The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.

(

**18629**views)