Logo

A Practical Introduction to Data Structures and Algorithm Analysis

Large book cover: A Practical Introduction to Data Structures and Algorithm Analysis

A Practical Introduction to Data Structures and Algorithm Analysis
by

Publisher: Virginia Tech
ISBN/ASIN: 0130284467
Number of pages: 638

Description:
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 data structure that will best solve a particular problem.

Home page url

Download or read it online for free here:
Download link
(2MB, PDF)

Similar books

Book cover: Fundamental Data StructuresFundamental Data Structures
- Wikipedia
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Contents of the book: Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching.
(15213 views)
Book cover: Greedy AlgorithmsGreedy Algorithms
by - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
(10939 views)
Book cover: LEDA: A Platform for Combinatorial and Geometric ComputingLEDA: A Platform for Combinatorial and Geometric Computing
by - 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.
(6355 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.
(8219 views)