Logo

Data Structures and Algorithms: Annotated Reference with Examples

Small book cover: Data Structures and Algorithms: Annotated Reference with Examples

Data Structures and Algorithms: Annotated Reference with Examples
by

Publisher: DotNetSlackers
Number of pages: 112

Description:
This book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most imperative programming languages. We assume that the reader is familiar with the following: (1) Big Oh notation; (2) An imperative programming language; (3) Object oriented concepts.

Home page url

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

Similar books

Book cover: Purely Functional Data StructuresPurely Functional Data Structures
by - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.
(5763 views)
Book cover: Lecture Notes on Bucket AlgorithmsLecture Notes on Bucket Algorithms
by - Birkhauser
In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the distribution of the data. The results are illustrated on standard searching, sorting and selection problems.
(8357 views)
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.
(9746 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(13369 views)