Skip to main content
SpringerLink
Log in
Book cover

Data Structures and Algorithms 1

Sorting and Searching

  • Textbook
  • © 1984

Overview

Authors:
  1. Kurt Mehlhorn

    1. FB 10, Angewandte Mathematik und Informatik, Universität des Saarlandes, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 1)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Foundations

    • Kurt Mehlhorn
    Pages 1-39

  3. Sorting

    • Kurt Mehlhorn
    Pages 40-101

  4. Sets

    • Kurt Mehlhorn
    Pages 102-316

  5. Algorithmic Paradigms

    • Kurt Mehlhorn
    Pages 317-324

  6. Back Matter

    Pages 325-336
    Download chapter PDF
Back to top

Keywords

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.

Authors and Affiliations

  • FB 10, Angewandte Mathematik und Informatik, Universität des Saarlandes, Germany

    Kurt Mehlhorn

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation