blas_ssort - sorts a real vector X in increasing or decreasing order using quick sort algorithm
SUBROUTINE BLAS_SSORT( SORT, N, X, INCX) INTEGER SORT, N, INCX REAL X(*)
SUBROUTINE BLAS_SSORT_64( SORT, N, X, INCX) INTEGER*8 SORT, N, INCX REAL X(*)
SUBROUTINE SORT( [SORT], [N], X, [INCX]) INTEGER :: SORT, N, INCX REAL, DIMENSION(:) :: X
SUBROUTINE SORT_64( [SORT], [N], X, [INCX]) INTEGER(8) :: SORT, N, INCX REAL, DIMENSION(:) :: X
#include <sunperf.h>
void blas_ssort(int sort, int n, float *x, int incx);
void blas_ssort_64(long sort, long n, float *x, long incx);
SORT = 1, ascending
SORT = other value, error
SORT is default to 1 for F95 INTERFACE
Minimum size (N-1)*|INCX|+1 is required
If SORT = 0, let SORT = 1, INCX = |INCX|;
If SORT = 1, let SORT = 0, INCX = |INCX|.
blas_ssortv(3P), blas_spermute(3P)