slasrt (l)  Linux Man Pages
slasrt: the number in D in increasing order (if ID = aqIaq) or in decreasing order (if ID = aqDaq )
Command to display slasrt
manual in Linux: $ man l slasrt
NAME
SLASRT  the number in D in increasing order (if ID = aqIaq) or in decreasing order (if ID = aqDaq )
SYNOPSIS
 SUBROUTINE SLASRT(

ID, N, D, INFO )

CHARACTER
ID

INTEGER
INFO, N

REAL
D( * )
PURPOSE
Sort the numbers in D in increasing order (if ID = aqIaq) or
in decreasing order (if ID = aqDaq ).
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

= aqIaq: sort D in increasing order;
= aqDaq: sort D in decreasing order.
 N (input) INTEGER

The length of the array D.
 D (input/output) REAL array, dimension (N)

On entry, the array to be sorted.
On exit, D has been sorted into increasing order
(D(1) <= ... <= D(N) ) or into decreasing order
(D(1) >= ... >= D(N) ), depending on ID.
 INFO (output) INTEGER

= 0: successful exit
< 0: if INFO = i, the ith argument had an illegal value
Pages related to slasrt
 slasrt (3)
 slasr (l)  applies a sequence of plane rotations to a real matrix A,
 slas2 (l)  computes the singular values of the 2by2 matrix [ F G ] [ 0 H ]
 slascl (l)  multiplies the M by N real matrix A by the real scalar CTO/CFROM
 slascl2 (l)  performs a diagonal scaling on a vector
 slasd0 (l)  a divide and conquer approach, SLASD0 computes the singular value decomposition (SVD) of a real upper bidiagonal NbyM matrix B with diagonal D and offdiagonal E, where M = N + SQRE
 slasd1 (l)  computes the SVD of an upper bidiagonal NbyM matrix B,
 slasd2 (l)  merges the two sets of singular values together into a single sorted set
 slasd3 (l)  finds all the square roots of the roots of the secular equation, as defined by the values in D and Z
 slasd4 (l)  subroutine compute the square root of the Ith updated eigenvalue of a positive symmetric rankone modification to a positive diagonal matrix whose entries are given as the squares of the corresponding entries in the array d, and that 0 <= D(i) < D(j) for i < j and that RHO > 0