Efficient data structures and algorithms, three volumes

Main
Computers - Algorithms and Data Structures
Efficient data structures and...

Efficient data structures and algorithms, three volumes

Name: Efficient data structures and algorithms, three volumes
ISBN: 9781212011121

Mehlhorn K.

0 / 0

0 comments

როგორ მოგეწონათ ეს წიგნი?

როგორი ხარისხისაა ეს ფაილი?

ჩატვირთეთ, ხარისხის შესაფასებლად

როგორი ხარისხისაა ჩატვირთული ფაილი?

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.

კატეგორია:

Computers - Algorithms and Data Structures

წელი:

1984

გამომცემლობა:

Springer

ენა:

english

გვერდები:

674

ISBN 10:

1212011120