Transferable FORTRAN Subroutine for Rapid Extended Sorting

  • Authors:

  • M. M. Rochkind

  • Affiliations:

  • Bell Telephone Labs., Inc.

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1970

Quantified Score

Hi-index 14.98

Visualization

Abstract

A transferable, utility grade, FORTRAN subroutine is described which sorts lists of arbitrary length and simultaneously resequences up to ten additional lists so as to retain a one-to-one correspondence between the elements of these additional lists and those of the list being sorted. Lists within lists may be sorted. A simple CALL permits all options and parameters to be specified. The code is based on the algorithm SHELLSORT.