Developer Reference for Intel® oneAPI Math Kernel Library for C
A newer version of this document is available. Customers should click here to go to the newest version.
?lapst
Sorts the numbers in increasing or decreasing order.
Syntax
void slapst (const char* id, const MKL_INT* n, const float* d, MKL_INT* indx, MKL_INT* info);
void dlapst (const char* id, const MKL_INT* n, const double* 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 232.
Input Parameters
- id
-
= 'I': sort d in increasing order;
= 'D': sort d in decreasing order.
- n
-
The length of the array d.
- d
-
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 |