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: A Practical Introduction to Data Structures and Algorithm AnalysisA Practical Introduction to Data Structures and Algorithm Analysis
by - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(7626 views)
Book cover: Tabu SearchTabu Search
by - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(8694 views)
Book cover: Modern Computer ArithmeticModern Computer Arithmetic
by - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(8708 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(6429 views)