**Open Data Structures: An Introduction**

by Pat Morin

**Publisher**: AU Press 2013**ISBN/ASIN**: 1927356385**ISBN-13**: 9781927356388**Number of pages**: 336

**Description**:

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.

Download or read it online for free here:

**Download link**

(multiple formats)

Download mirrors:**Mirror 1**

## Similar books

**Elementary Algorithms**

by

**Larry LIU Xinyu**-

**Github**

'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.

(

**1752**views)

**Algorithms**

by

**Ian Craw, John Pulham**-

**University of Aberdeen**

This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.

(

**9801**views)

**Algorithms and Data Structures: With Applications to Graphics and Geometry**

by

**Jurg Nievergelt, Klaus Hinrichs**-

**Prentice Hall**

Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.

(

**2741**views)

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

(

**8637**views)