\brief \b ESMF_DLAMRG \htmlonly Download ESMF_DLAMRG + dependencies [TGZ] [ZIP] [TXT] \endhtmlonly \par Purpose:
\verbatim
ESMF_DLAMRG 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. \endverbatim \param[in] N1 \verbatim N1 is INTEGER \endverbatim
\param[in] N2 \verbatim N2 is INTEGER These arguements contain the respective lengths of the two sorted lists to be merged. \endverbatim
\param[in] A \verbatim A is DOUBLE PRECISION 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. \endverbatim
\param[in] DTRD1 \verbatim DTRD1 is INTEGER \endverbatim
\param[in] DTRD2 \verbatim DTRD2 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 (DTRDx = 1) or descending (DTRDx = -1) order. \endverbatim
\param[out] INDEX \verbatim 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. \endverbatim \author Univ. of Tennessee \author Univ. of California Berkeley \author Univ. of Colorado Denver \author NAG Ltd. \date November 2011 \ingroup auxOTHERcomputational
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer | :: | N1 | ||||
| integer | :: | N2 | ||||
| double precision | :: | A(*) | ||||
| integer | :: | DTRD1 | ||||
| integer | :: | DTRD2 | ||||
| integer | :: | INDEX(*) |