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

(

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

(

**13362**views)

**Computational Geometry: Methods and Applications**

by

**Jianer Chen**

The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.

(

**11987**views)

**LEDA: A Platform for Combinatorial and Geometric Computing**

by

**K. Mehlhorn, St. NĂ¤her**-

**Cambridge University Press**

The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.

(

**6035**views)