# NAG FL Interfaceg05ncf (permute)

## ▸▿ Contents

Settings help

FL Name Style:

FL Specification Language:

## 1Purpose

g05ncf performs a pseudorandom permutation of a vector of integers.

## 2Specification

Fortran Interface
 Subroutine g05ncf ( indx, n,
 Integer, Intent (In) :: n Integer, Intent (Inout) :: indx(n), state(*), ifail
#include <nag.h>
 void g05ncf_ (Integer indx[], const Integer *n, Integer state[], Integer *ifail)
The routine may be called by the names g05ncf or nagf_rand_permute.

## 3Description

g05ncf permutes the elements of an integer array without inspecting their values. Each of the $n!$ possible permutations of the $n$ values may be regarded as being equally probable.
Even for modest values of $n$ it is theoretically impossible that all $n!$ permutations may occur, as $n!$ is likely to exceed the cycle length of any of the base generators. For practical purposes this is irrelevant, as the time necessary to generate all possible permutations is many millenia.
One of the initialization routines g05kff (for a repeatable sequence if computed sequentially) or g05kgf (for a non-repeatable sequence) must be called prior to the first call to g05ncf.
Kendall M G and Stuart A (1969) The Advanced Theory of Statistics (Volume 1) (3rd Edition) Griffin
Knuth D E (1981) The Art of Computer Programming (Volume 2) (2nd Edition) Addison–Wesley

## 5Arguments

1: $\mathbf{indx}\left({\mathbf{n}}\right)$Integer array Input/Output
On entry: the $n$ integer values to be permuted.
On exit: the $n$ permuted integer values.
2: $\mathbf{n}$Integer Input
On entry: the number of values to be permuted.
Constraint: ${\mathbf{n}}\ge 1$.
3: $\mathbf{state}\left(*\right)$Integer array Communication Array
Note: the actual argument supplied must be the array state supplied to the initialization routines g05kff or g05kgf.
On entry: contains information on the selected base generator and its current state.
On exit: contains updated information on the state of the generator.
4: $\mathbf{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 $-\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{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:
${\mathbf{ifail}}=2$
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 1$.
${\mathbf{ifail}}=3$
On entry, state vector has been corrupted or not initialized.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{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.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

Not applicable.

## 8Parallelism and Performance

g05ncf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

None.

## 10Example

In the example program a vector containing the first eight positive integers in ascending order is permuted by a call to g05ncf and the permutation is printed. This is repeated a total of ten times, after initialization by g05kff.

### 10.1Program Text

Program Text (g05ncfe.f90)

### 10.2Program Data

Program Data (g05ncfe.d)

### 10.3Program Results

Program Results (g05ncfe.r)