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 INTEGER N REAL X(*) INTEGER INCX SUBROUTINE BLAS_SSORT_64 (SORT, N, X, INCX) INTEGER*8 SORT INTEGER*8 N REAL X(*) INTEGER*8 INCX F95 INTERFACE SUBROUTINE SORT (SORT, N, X, INCX) USE SUNPERF SUBROUTINE SORT_64 (SORT, N, X, INCX) USE SUNPERF The functionality of SORT is covered by SORTV
Oracle Solaris Studio Performance Library blas_ssort(3P) NAME blas_ssort - sorts a real vector X in increasing or decreasing order using quick sort algorithm SYNOPSIS SUBROUTINE BLAS_SSORT (SORT, N, X, INCX) INTEGER SORT INTEGER N REAL X(*) INTEGER INCX SUBROUTINE BLAS_SSORT_64 (SORT, N, X, INCX) INTEGER*8 SORT INTEGER*8 N REAL X(*) INTEGER*8 INCX F95 INTERFACE SUBROUTINE SORT (SORT, N, X, INCX) USE SUNPERF SUBROUTINE SORT_64 (SORT, N, X, INCX) 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((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 ALSO blas_ssortv(3P), blas_spermute(3P) 7 Nov 2015 blas_ssort(3P)