Internal sorting with minimal comparing

  • Authors:

  • L. J. Woodrum

  • Affiliations:

  • -

  • Venue:
  • IBM Systems Journal
  • Year:
  • 1969

Quantified Score

Hi-index 0.00

Visualization

Abstract

An ordering operator that leads to the development of an algorithm for internal sorting is described. An analysis of the algorithm is presented, together with a discussion of the number of comparisons necessary for sorting. It is shown that the number of comparisons is close to the theoretically obtainable number. The sorting algorithm is a variant of the two-way merge.