0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Algorithms and Data Structures - The Basic Toolbox (Hardcover, 2008 ed.) Loot Price: R1,665
Discovery Miles 16 650
Algorithms and Data Structures - The Basic Toolbox (Hardcover, 2008 ed.): Kurt Mehlhorn, Peter Sanders

Algorithms and Data Structures - The Basic Toolbox (Hardcover, 2008 ed.)

Kurt Mehlhorn, Peter Sanders

 (sign in to rate)
Loot Price R1,665 Discovery Miles 16 650 | Repayment Terms: R156 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems.

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.

The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.

General

Imprint: Springer-Verlag
Country of origin: Germany
Release date: June 2008
First published: 2008
Authors: Kurt Mehlhorn • Peter Sanders
Dimensions: 235 x 155 x 22mm (L x W x T)
Format: Hardcover
Pages: 300
Edition: 2008 ed.
ISBN-13: 978-3-540-77977-3
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
LSN: 3-540-77977-9
Barcode: 9783540779773

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners