Logo

Open Data Structures: An Introduction

Large book cover: Open Data Structures: An Introduction

Open Data Structures: An Introduction
by

Publisher: AU Press
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.

Home page url

Download or read it online for free here:
Download link
(multiple formats)

Download mirrors:
Mirror 1

Similar books

Book cover: Elementary AlgorithmsElementary Algorithms
by - 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.
(2433 views)
Book cover: Efficient Algorithms for Sorting and SynchronizationEfficient Algorithms for Sorting and Synchronization
by - 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.
(9110 views)
Book cover: Search Algorithms and ApplicationsSearch Algorithms and Applications
by - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
(9610 views)
Book cover: Algorithms and Data StructuresAlgorithms and Data Structures
by - Prentice Hall
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.
(11205 views)