.TH "lamrg" 3 "Wed Feb 7 2024 11:30:40" "Version 3.12.0" "LAPACK" \" -*- nroff -*-
.ad l
.nh
.SH NAME
lamrg \- lamrg: permutation to merge 2 sorted lists
.SH SYNOPSIS
.br
.PP
.SS "Functions"

.in +1c
.ti -1c
.RI "subroutine \fBdlamrg\fP (n1, n2, a, dtrd1, dtrd2, index)"
.br
.RI "\fBDLAMRG\fP creates a permutation list to merge the entries of two independently sorted sets into a single set sorted in ascending order\&. "
.ti -1c
.RI "subroutine \fBslamrg\fP (n1, n2, a, strd1, strd2, index)"
.br
.RI "\fBSLAMRG\fP creates a permutation list to merge the entries of two independently sorted sets into a single set sorted in ascending order\&. "
.in -1c
.SH "Detailed Description"
.PP 

.SH "Function Documentation"
.PP 
.SS "subroutine dlamrg (integer n1, integer n2, double precision, dimension( * ) a, integer dtrd1, integer dtrd2, integer, dimension( * ) index)"

.PP
\fBDLAMRG\fP creates a permutation list to merge the entries of two independently sorted sets into a single set sorted in ascending order\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 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\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN1\fP 
.PP
.nf
          N1 is INTEGER
.fi
.PP
.br
\fIN2\fP 
.PP
.nf
          N2 is INTEGER
         These arguments contain the respective lengths of the two
         sorted lists to be merged\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          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\&.
.fi
.PP
.br
\fIDTRD1\fP 
.PP
.nf
          DTRD1 is INTEGER
.fi
.PP
.br
\fIDTRD2\fP 
.PP
.nf
          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\&.
.fi
.PP
.br
\fIINDEX\fP 
.PP
.nf
          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\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP

.SS "subroutine slamrg (integer n1, integer n2, real, dimension( * ) a, integer strd1, integer strd2, integer, dimension( * ) index)"

.PP
\fBSLAMRG\fP creates a permutation list to merge the entries of two independently sorted sets into a single set sorted in ascending order\&.  
.PP
\fBPurpose:\fP
.RS 4

.PP
.nf
 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\&.
.fi
.PP
 
.RE
.PP
\fBParameters\fP
.RS 4
\fIN1\fP 
.PP
.nf
          N1 is INTEGER
.fi
.PP
.br
\fIN2\fP 
.PP
.nf
          N2 is INTEGER
         These arguments contain the respective lengths of the two
         sorted lists to be merged\&.
.fi
.PP
.br
\fIA\fP 
.PP
.nf
          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\&.
.fi
.PP
.br
\fISTRD1\fP 
.PP
.nf
          STRD1 is INTEGER
.fi
.PP
.br
\fISTRD2\fP 
.PP
.nf
          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\&.
.fi
.PP
.br
\fIINDEX\fP 
.PP
.nf
          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\&.
.fi
.PP
 
.RE
.PP
\fBAuthor\fP
.RS 4
Univ\&. of Tennessee 
.PP
Univ\&. of California Berkeley 
.PP
Univ\&. of Colorado Denver 
.PP
NAG Ltd\&. 
.RE
.PP

.SH "Author"
.PP 
Generated automatically by Doxygen for LAPACK from the source code\&.