Heapsort—Adapted for presorted files

  • Christos Levcopoulos
  • Ola Petersson
Conference paper

DOI: 10.1007/3-540-51542-9_41

Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)
Cite this paper as:
Levcopoulos C., Petersson O. (1989) Heapsort—Adapted for presorted files. In: Dehne F., Sack J.R., Santoro N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg

Abstract

We provide a new sorting algorithm which is optimal with respect to several known, and new, measures of presortedness. A new such measure, called Osc(X), measures the oscillation within the input data. The measure has an interesting application in the sweep-line technique in computational geometry. Our algorithm is based on a new approach which yields space efficiency and it uses simple data structures. For example, after a linear time preprocessing step, the only data structures used are a static tree and a heap.

Key words

sorting algorithm measures presortedness heap geometric interpretation optimality 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Christos Levcopoulos
    • 1
  • Ola Petersson
    • 1
  1. 1.Department of Computer and Information ScienceLinköping UniversityLinköpingSweden
  2. 2.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations