Issue No.03 - March (1970 vol.19)
M.M. Rochkind , Bell Telephone Labs., Inc.
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.
Benchmarks, file maintenance, FORTRAN subroutine, list rearrangement, pairwise exchange, portability, sorting.
M.M. Rochkind, "Transferable FORTRAN Subroutine for Rapid Extended Sorting", IEEE Transactions on Computers, vol.19, no. 3, pp. 270-272, March 1970, doi:10.1109/T-C.1970.222908