![]() |
LAPACK
3.4.0
LAPACK: Linear Algebra PACKage
|
Go to the source code of this file.
Functions/Subroutines | |
| subroutine | SLAMRG (N1, N2, A, STRD1, STRD2, INDEX) |
| SLAMRG | |
| subroutine SLAMRG | ( | INTEGER | N1, |
| INTEGER | N2, | ||
| REAL, dimension( * ) | A, | ||
| INTEGER | STRD1, | ||
| INTEGER | STRD2, | ||
| INTEGER, dimension( * ) | INDEX | ||
| ) |
SLAMRG
Download SLAMRG + dependencies [TGZ] [ZIP] [TXT]SLAMRG will create a permutation list which will merge the elements of A (which is composed of two independently sorted sets) into a single set which is sorted in ascending order.
| [in] | N1 |
N1 is INTEGER
|
| [in] | N2 |
N2 is INTEGER
These arguements contain the respective lengths of the two
sorted lists to be merged.
|
| [in] | A |
A is REAL array, dimension (N1+N2)
The first N1 elements of A contain a list of numbers which
are sorted in either ascending or descending order. Likewise
for the final N2 elements.
|
| [in] | STRD1 |
STRD1 is INTEGER
|
| [in] | STRD2 |
STRD2 is INTEGER
These are the strides to be taken through the array A.
Allowable strides are 1 and -1. They indicate whether a
subset of A is sorted in ascending (STRDx = 1) or descending
(STRDx = -1) order.
|
| [out] | INDEX |
INDEX is INTEGER array, dimension (N1+N2)
On exit this array will contain a permutation such that
if B( I ) = A( INDEX( I ) ) for I=1,N1+N2, then B will be
sorted in ascending order.
|
Definition at line 100 of file slamrg.f.