blas_isortv (3p)

Name

blas_isortv - sorts a real vector X in increasing or decreasing order using quick sort algorithm and overwrite P with the permutation vector

Synopsis

SUBROUTINE BLAS_ISORTV (SORT, N, X, INCX, P, INCP)

INTEGER SORT
INTEGER N
INTEGER X(*)
INTEGER INCX
INTEGER P(*)
INTEGER INCP

SUBROUTINE BLAS_ISORTV_64 (SORT, N, X, INCX, P, INCP)

INTEGER*8 SORT
INTEGER*8 N
INTEGER*8 X(*)
INTEGER*8 INCX
INTEGER*8 P(*)
INTEGER*8 INCP




F95 INTERFACE
SUBROUTINE SORTV (SORT, N, X, INCX, P, INCP)

USE SUNPERF

SUBROUTINE SORTV_64 (SORT, N, X, INCX, P, INCP)

USE SUNPERF

SORTV covers the functionality of SORT

Description

Oracle Solaris Studio Performance Library                      blas_isortv(3P)



NAME
       blas_isortv  -  sorts a real vector X in increasing or decreasing order
       using quick sort algorithm and overwrite P with the permutation vector

SYNOPSIS
       SUBROUTINE BLAS_ISORTV (SORT, N, X, INCX, P, INCP)

       INTEGER SORT
       INTEGER N
       INTEGER X(*)
       INTEGER INCX
       INTEGER P(*)
       INTEGER INCP

       SUBROUTINE BLAS_ISORTV_64 (SORT, N, X, INCX, P, INCP)

       INTEGER*8 SORT
       INTEGER*8 N
       INTEGER*8 X(*)
       INTEGER*8 INCX
       INTEGER*8 P(*)
       INTEGER*8 INCP




   F95 INTERFACE
       SUBROUTINE SORTV (SORT, N, X, INCX, P, INCP)

       USE SUNPERF

       SUBROUTINE SORTV_64 (SORT, N, X, INCX, P, INCP)

       USE SUNPERF

       SORTV covers the functionality of SORT




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) INTEGER((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|.

       P (output) INTEGER((N-1)*|INCP|+1), the permutation (index)
                 vector  recording the details of the interchanges of the ele-
                 ments of X during sorting. That is X = P*X. In this implemen-
                 tation, P contains the index of sorted X.

       INCP (input) INTEGER, increment fpr P
                 INCP  must  not be zero. INCP could be negative. If INCP < 0,
                 store P(i) in reverse order. That is
                 If INCP > 0,
                   if INCX > 0,
                     sorted X((i-1)*INCX+1) = X(P((i-1)*INCP+1)),
                   if INCX < 0,
                     sorted X((N-i)*|INCX|+1) = X(P((i-1)*INCP+1));
                 If INCP < 0,
                   if INCX > 0,
                     sorted X((i-1)*INCX+1) = X(P((N-i)*|INCP|+1)),
                   if INCX < 0,
                     sorted X((N-i)*|INCX|+1)
                          = X(P((N-i)*|INCP|+1)).

SEE ALSO
       blas_isort(3P), blas_ipermute(3P)



                                  7 Nov 2015                   blas_isortv(3P)