NAME

blas_isort - sorts an integer vector X in increasing or decreasing order using quick sort algorithm

SYNOPSIS

  SUBROUTINE BLAS_ISORT( SORT, N, X, INCX)
  INTEGER SORT, N, INCX
  INTEGER X(*)

  SUBROUTINE BLAS_ISORT_64( SORT, N, X, INCX)
  INTEGER*8 SORT, N, INCX
  INTEGER*8 X(*)

  SUBROUTINE SORT( [SORT], [N], X, [INCX])
  INTEGER :: SORT, N, INCX
  INTEGER, DIMENSION(:) :: X

  SUBROUTINE SORT_64( [SORT], [N], X, [INCX])
  INTEGER(8) :: SORT, N, INCX
  INTEGER(8), DIMENSION(:) :: X

#include <sunperf.h>

void blas_isort(int sort, int n, int *x, int incx);

void blas_isort_64(long sort, long n, long *x, long incx);

SORT (input)
SORT = 0, descending
SORT = 1, ascending

SORT = other value, error

SORT is default to 1 for F95 INTERFACE
N (input)
If N < = 1, the subroutine returns without trying to sort X.
X (input/output)
sorted
Minimum size (N-1)*|INCX|+1 is required
INCX (input)
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|.