© 1984

Data Structures and Algorithms 1

Sorting and Searching


Part of the EATCS book series (EATCS, volume 1)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Kurt Mehlhorn
    Pages 1-39
  3. Kurt Mehlhorn
    Pages 40-101
  4. Kurt Mehlhorn
    Pages 102-316
  5. Kurt Mehlhorn
    Pages 317-324
  6. Back Matter
    Pages 325-336

About this book


The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen­ dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith­ mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa­ tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven­ tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.


NP-completeness Structures algorithms computer computer science data structures sorting

Authors and affiliations

  1. 1.FB 10, Angewandte Mathematik und InformatikUniversität des SaarlandesGermany

Bibliographic information

  • Book Title Data Structures and Algorithms 1
  • Book Subtitle Sorting and Searching
  • Authors K. Mehlhorn
  • Series Title EATCS
  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1984
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Hardcover ISBN 978-3-540-13302-5
  • Softcover ISBN 978-3-642-69674-9
  • eBook ISBN 978-3-642-69672-5
  • Series ISSN 1431-2654
  • Edition Number 1
  • Number of Pages XIV, 336
  • Number of Illustrations 0 b/w illustrations, 0 illustrations in colour
  • Additional Information Original German edition published by B.G. Teubner Verlag, 1977
  • Topics Computation by Abstract Devices
    Data Structures
    Algorithm Analysis and Problem Complexity
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment