Purpose
=======
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.
Namespace: DotNumerics.LinearAlgebra.CSLapackAssembly: DWSIM.MathOps.DotNumerics (in DWSIM.MathOps.DotNumerics.dll) Version: 1.0.0.0 (1.0.0.0)
Syntax public void Run(
int N1,
int N2,
double[] A,
int offset_a,
int DTRD1,
int DTRD2,
ref int[] INDEX,
int offset_index
)
Public Sub Run (
N1 As Integer,
N2 As Integer,
A As Double(),
offset_a As Integer,
DTRD1 As Integer,
DTRD2 As Integer,
ByRef INDEX As Integer(),
offset_index As Integer
)
Request Example
View SourceParameters
- N1 Int32
-
(input) INTEGER
- N2 Int32
-
(input) INTEGER
These arguements contain the respective lengths of the two
sorted lists to be merged.
- A Double
-
(input) 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.
- offset_a Int32
-
- DTRD1 Int32
-
(input) INTEGER
- DTRD2 Int32
-
(input) 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.
- INDEX Int32
-
(output) 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.
- offset_index Int32
-
See Also