**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

**Algorithms: Fundamental Techniques**

by

**Macneil Shonle, Matthew Wilson, Martin Krischik**-

**Wikibooks**

An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.

(

**12388**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.

(

**7866**views)

**Average Case Analysis of Algorithms on Sequences**

by

**Wojciech Szpankowski**-

**Wiley-Interscience**

A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.

(

**8381**views)

**Algorithms**

by

**Robert Sedgewick, Kevin Wayne**-

**Addison-Wesley Professional**

This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.

(

**6637**views)