NAG FL Interface
m01def (realmat_​rank_​rows)

1 Purpose

m01def ranks the rows of a matrix of real numbers in ascending or descending order.

2 Specification

Fortran Interface
Subroutine m01def ( rm, ldm, m1, m2, n1, n2, order, irank, ifail)
Integer, Intent (In) :: ldm, m1, m2, n1, n2
Integer, Intent (Inout) :: ifail
Integer, Intent (Out) :: irank(m2)
Real (Kind=nag_wp), Intent (In) :: rm(ldm,n2)
Character (1), Intent (In) :: order
C Header Interface
#include <nag.h>
void  m01def_ (const double rm[], const Integer *ldm, const Integer *m1, const Integer *m2, const Integer *n1, const Integer *n2, const char *order, Integer irank[], Integer *ifail, const Charlen length_order)
The routine may be called by the names m01def or nagf_sort_realmat_rank_rows.

3 Description

m01def ranks rows m1 to m2 of a matrix, using the data in columns n1 to n2 of those rows. The ordering is determined by first ranking the data in column n1, then ranking any tied rows according to the data in column n1+1, and so on up to column n2.
m01def uses a variant of list-merging, as described on pages 165–166 in Knuth (1973). The routine takes advantage of natural ordering in the data, and uses a simple list insertion in a preparatory pass to generate ordered lists of length at least 10. The ranking is stable: equal rows preserve their ordering in the input data.

4 References

Knuth D E (1973) The Art of Computer Programming (Volume 3) (2nd Edition) Addison–Wesley

5 Arguments

1: rmldmn2 Real (Kind=nag_wp) array Input
On entry: columns n1 to n2 of rows m1 to m2 of rm must contain real data to be ranked.
2: ldm Integer Input
On entry: the first dimension of the array rm as declared in the (sub)program from which m01def is called.
Constraint: ldmm2.
3: m1 Integer Input
On entry: the index of the first row of rm to be ranked.
Constraint: m1>0.
4: m2 Integer Input
On entry: the index of the last row of rm to be ranked.
Constraint: m2m1.
5: n1 Integer Input
On entry: the index of the first column of rm to be used.
Constraint: n1>0.
6: n2 Integer Input
On entry: the index of the last column of rm to be used.
Constraint: n2n1.
7: order Character(1) Input
On entry: if order='A', the rows will be ranked in ascending (i.e., nondecreasing) order.
If order='D', into descending order.
Constraint: order='A' or 'D'.
8: irankm2 Integer array Output
On exit: elements m1 to m2 of irank contain the ranks of the corresponding rows of rm. Note that the ranks are in the range m1 to m2: thus, if the ith row of rm is the first in the rank order, iranki is set to m1.
9: ifail Integer Input/Output
On entry: ifail must be set to 0, -1 or 1 to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of 0 causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of -1 means that an error message is printed while a value of 1 means that it is not.
If halting is not appropriate, the value -1 or 1 is recommended. If message printing is undesirable, then the value 1 is recommended. Otherwise, the value 0 is recommended. When the value -1 or 1 is used it is essential to test the value of ifail on exit.
On exit: ifail=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry ifail=0 or -1, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
ifail=1
On entry, m1=value.
Constraint: m11.
On entry, m1=value and m2=value.
Constratint: m1m2.
On entry, m2=value.
Constraint: m21.
On entry, m2=value and ldm=value.
Constraint: m2ldm.
On entry, n1=value.
Constraint: n11.
On entry, n1=value and n2=value.
Constraint: n1n2.
On entry, n2=value.
Constraint: n21.
ifail=2
On entry, order has an illegal value: order=value.
ifail=-99
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
ifail=-399
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
ifail=-999
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

Not applicable.

8 Parallelism and Performance

m01def is not threaded in any implementation.

9 Further Comments

The average time taken by the routine is approximately proportional to n×logn, where n=m2-m1+1.

10 Example

This example reads a matrix of real numbers and ranks the rows in ascending order.

10.1 Program Text

Program Text (m01defe.f90)

10.2 Program Data

Program Data (m01defe.d)

10.3 Program Results

Program Results (m01defe.r)