Algorithms and Data Structures

The Basic Toolbox

By Kurt Mehlhorn , Peter Sanders

Algorithms and Data Structures Cover Image

This concise introduction is ideal for readers familiar with programming and basic mathematical language. It uses pictures, words and high-level pseudocode to explain algorithms and presents efficient implementations using real programming languages.

Full Description

  • ISBN13: 978-3-5407-7977-3
  • 316 Pages
  • User Level: Students
  • Publication Date: May 27, 2008
  • Available eBook Formats: PDF
  • eBook Price: $49.95
Buy eBook Buy Print Book Add to Wishlist
Full Description
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.
Table of Contents

Table of Contents

  1. Appetizer: Integer Arithmetic.
  2. Introduction.
  3. Representing Sequences by Arrays and Linked Lists.
  4. Hash Tables and Associative Arrays.
  5. Sorting and Selection.
  6. Priority Queues.
  7. Sorted Sequences.
  8. Graph Representation.
  9. Graph Traversal.
  10. Shortest Paths.
  11. Minimum Spanning Trees.
  12. Generic Approaches to Optimization.
  13. App. A
  14. Notation.
  15. Bibliography.
Errata

Please Login to submit errata.

No errata are currently published