Developer Reference for Intel® oneAPI Math Kernel Library for C
?lapst
Sorts the numbers in increasing or decreasing order.
Syntax
void slapst ( constchar*id , constMKL_INT*n , constfloat*d , MKL_INT*indx , MKL_INT*info );
void dlapst ( constchar*id , constMKL_INT*n , constdouble*d , MKL_INT*indx , MKL_INT*info );
Include Files
mkl_scalapack.h
Description
?lapst is a modified version of the LAPACK routine ?lasrt .
Define a permutation indx that sorts the numbers in d in increasing order (if id = ‘I’) or in decreasing order (if id = ‘D’ ).
Use Quick Sort, reverting to Insertion sort on arrays of size <= 20. Dimension of STACK limits n to about 2 32 .
Input Parameters
id
= ‘I’: sort d in increasing order; = ‘D’: sort d in decreasing order.
n
The length of the array d .
- d
-
REAL for slapst DOUBLE PRECISION for dlapst Array, size ( n ) The array to be sorted.
Output Parameters
indx
Array, size ( n ). The permutation which sorts the array d .
info
= 0: successful exit < 0: if info = -i, the i-th argument had an illegal value