๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Data Structures and Algorithms [html]

โœ Scribed by Alfred Aho


Book ID
127457025
Publisher
Addison Wesley
Year
1983
Tongue
English
Weight
7 MB
Edition
1st
Category
Library
ISBN-13
9780201000238

No coin nor oath required. For personal study only.

โœฆ Synopsis


This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work. The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal.


๐Ÿ“œ SIMILAR VOLUMES


Data Structures and Algorithms
โœ Wirth, Niklaus ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Nature Publishing Group ๐ŸŒ English โš– 747 KB
Data structures and network algorithms
โœ Robert Endre Tarjan ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 1 MB

The first half of the book covers the data structures used in solving the network problems that are presented in the second half. These data structures including disjoint sets, heaps, and search trees. Highlights of this half of the book are Tarjan's proof of the amoritized cost of union find, and e

Data structures and network algorithms
โœ Robert Endre Tarjan ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 1 MB

There has been an explosive growth in the field of combinatorial algorithms. These algorithms depend not only on results in combinatorics and especially in graph theory, but also on the development of new data structures and new techniques for analyzing algorithms. Four classical problems in networ