blas_dsort(3P) Sun Performance Library blas_dsort(3P)NAMEblas_dsort - sorts a real (double precision) vector X in increasing or
decreasing order using quick sort algorithm
SYNOPSIS
SUBROUTINE BLAS_DSORT (SORT, N, X, INCX)
INTEGER SORT
INTEGER N
REAL*8 X(*)
INTEGER INCX
SUBROUTINE BLAS_DSORT_64 (SORT, N, X, INCX)
INTEGER*8 SORT
INTEGER*8 N
REAL*8 X(*)
INTEGER*8 INCX
F95 INTERFACE
SUBROUTINE SORT (X [, SORT])
USE SUNPERF
SUBROUTINE SORT_64 (X [, SORT])
USE SUNPERF
The functionality of SORT is covered by SORTV
ARGUMENTS
SORT (input) INTEGER, indicating sort directions
SORT = 0, descending
SORT = 1, ascending
SORT = other value, error
SORT is default to 1 for F95 INTERFACE
N (input) INTEGER, the number of elements to be sorted in X
If N <= 1, the subroutine returns without trying to sort X.
X (input/output) REAL*8((N-1)*|INCX|+1), the array to be
sorted
Minimum size (N-1)*|INCX|+1 is required
INCX (input) INTEGER, increment for X
INCX must not be zero. INCX could be negative. If INCX < 0,
change the sorting direction defined by SORT. That is
If SORT = 0, let SORT = 1, INCX = |INCX|;
If SORT = 1, let SORT = 0, INCX = |INCX|.
SEE ALSOblas_dsortv(3P), blas_dpermute(3P)
6 Mar 2009 blas_dsort(3P)
