Document: RANK Purpose: Describes the available ranking routines. Category: MATH File: rank.c Author: K.G. Begeman Description: The RANK.. routines index an array ARRIN of length N, i.e. outputs an integer array INDX such that ARRIN(INDX(J)+1) is in ascending or descending order for J = 1, 2, ..., N. The input quantities N and ARRIN are not changed. The heapsort algorithm is used. The folowing routines are available: SUBROUTINE RANKIA( ARRIN, INDX, N ) indexes an integer array in ascending order. SUBROUTINE RANKID( ARRIN, INDX, N ) indexes an integer array in descending order. SUBROUTINE RANKRA( ARRIN, INDX, N ) indexes a single precision array in ascending order. SUBROUTINE RANKRD( ARRIN, INDX, N ) indexes a single precision array in descending order. SUBROUTINE RANKDA( ARRIN, INDX, N ) indexes a double precision array in ascending order. SUBROUTINE RANKDD( ARRIN, INDX, N ) indexes a double precision array in descending order. Updates: May 26, 1990: KGB, Document created.