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
SUBROUTINE SLAMRG( N1, N2, A, TRD1, TRD2, INDEX) INTEGER N1, N2, TRD1, TRD2 INTEGER INDEX(*) REAL A(*)
SUBROUTINE SLAMRG_64( N1, N2, A, TRD1, TRD2, INDEX) INTEGER*8 N1, N2, TRD1, TRD2 INTEGER*8 INDEX(*) REAL A(*)
SUBROUTINE LAMRG( N1, N2, A, TRD1, TRD2, INDEX) INTEGER :: N1, N2, TRD1, TRD2 INTEGER, DIMENSION(:) :: INDEX REAL, DIMENSION(:) :: A
SUBROUTINE LAMRG_64( N1, N2, A, TRD1, TRD2, INDEX) INTEGER(8) :: N1, N2, TRD1, TRD2 INTEGER(8), DIMENSION(:) :: INDEX REAL, DIMENSION(:) :: A
#include <sunperf.h>
void slamrg(int n1, int n2, float *a, int trd1, int trd2, int *index);
void slamrg_64(long n1, long n2, float *a, long trd1, long trd2, long *index);
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.
= -1 subset is sorted in descending order.
= 1 subset is sorted in ascending order.
= -1 subset is sorted in descending order.
= 1 subset is sorted in ascending order.