DragonFly On-Line Manual Pages

DLAPST(l)                              )                             DLAPST(l)

NAME
       DLAPST -  Define a permutation INDX that sorts the numbers in D in
       increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )

SYNOPSIS
       SUBROUTINE DLAPST( ID, N, D, INDX, INFO )
           CHARACTER ID
           INTEGER INFO, N
           INTEGER INDX( * )
           DOUBLE PRECISION D( * )

PURPOSE
       Define a permutation INDX that sorts the numbers in D in increasing
       order (if ID = 'I') or in decreasing order (if ID = 'D' ).  Use Quick
       Sort, reverting to Insertion sort on arrays of
       size <= 20. Dimension of STACK limits N to about 2**32.

ARGUMENTS
       ID      (input) CHARACTER*1
               = 'I': sort D in increasing order;
               = 'D': sort D in decreasing order.

       N       (input) INTEGER
               The length of the array D.

       D       (input)  DOUBLE PRECISION array, dimension (N)
               The array to be sorted.

       INDX    (ouput) INTEGER array, dimension (N).
               The permutation which sorts the array D.

       INFO    (output) INTEGER
               = 0:  successful exit
               < 0:  if INFO = -i, the i-th argument had an illegal value

ScaLAPACK version 1.7           13 August 2001                       DLAPST(l)