ENGLISH

Efficient data structures and algorithms, three volumes

By Mehlhorn K.

Book information

Publisher
Springer
Year
1984
ISBN
121-201-112-0
Language
english
Format
DJVU
Filesize
4 MB (4539606 bytes)
Pages
674\674
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11

Description

This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java.

Similar books