To rearrange data into a different order without using additional storage, the simplest method is to decompose the permutation which specifies the new order into cycles and then to do a cyclic permutation of the data items in each cycle. (This is the method used by the M01E reordering routines.) Given a vector IRANK which specifies the ranks of the data (as generated by the M01D routines),
m01zcf generates a new vector
icycl, in which the permutation is represented in its component cycles, with the first element of each cycle negated. For example, the permutation
is composed of the cycles
and the vector
icycl generated by
m01zcf contains
In order to rearrange the data according to the specified ranks:
- item $6$ must be left in place;
- items $1$ and $5$ must be interchanged;
- items $4$, $2$, $7$ and $3$ must be moved right one place round the cycle.
The complete rearrangement can be achieved by the following code:
Do 10 k = m1, m2
i = icycl(k)
If (i.lt.0) Then
j = -i
Else
[swap items i and j]
Endif
10 Continue
None.
If on entry
${\mathbf{ifail}}=0$ or
$-1$, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Not applicable.
None.
This example reads a matrix of real numbers and rearranges its columns so that the elements of the
$l$th row are in ascending order. To do this, the program first calls
m01djf to rank the elements of the
$l$th row, and then calls
m01zcf to decompose the rank vector into cycles. It then rearranges the columns using the framework of code suggested in
Section 3. The value of
$l$ is read from the data file.