Sorting Partially Ordered Data of Arbitrary Structure in Memory
Sort data having an organization or structure not supported by one of the
subprograms in Chapter 18.1
, for example, data having more than one
key to determine the sorted order. This subprogram has similar
functionality to GSORTP of Chapter 18.2
and is more efficient when
the data are initially partially ordered, or when the ordering criterion is
expensive to determine.
This software is part of the MATH77/mathc90 collection here.