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.
Keywords :
Benchmarks, file maintenance, FORTRAN subroutine, list rearrangement, pairwise exchange, portability, sorting.; Algorithms; Clocks; High performance computing; Information retrieval; Packaging machines; Portable computers; Software packages; Software performance; Sorting; Benchmarks, file maintenance, FORTRAN subroutine, list rearrangement, pairwise exchange, portability, sorting.;
