Sorting with large volume, random access, drum storage

  • Authors:

  • Joel Falkin;Sal Savastano, Jr.

  • Affiliations:

  • Teleregister Corp., Stamford, CT;Teleregister Corp., Stamford, CT

  • Venue:
  • Communications of the ACM
  • Year:
  • 1963

  • Sorting

    ACM Computing Surveys (CSUR)

Quantified Score

Hi-index 48.22

Visualization

Abstract

An approach to sorting records is described using random access drum memory. The Sort program described is designed to be a generalized, self-generating sort, applicable to a variety of record statements. This description is divided into three parts. The first part presents the operating environment; the second defines the general solution; the third part describes the internal sort-merge technique.