Developer Reference

  • 0.9
  • 09/09/2020
  • Public Content
Contents

?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 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
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

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804