RightInversionToPermutation constructs the permutation, $a$, of integers 1 to $n$ corresponding to the inversion table c, where $c_j$ is the number of elements to the right of $j$ in $a$ that are less than $j$.

The c parameter is a right inversion table; it may be a list or one-dimensional rtable indexed from one, with $0\le c_j\le j-1$

The output is an Array indexed from 1 to $n$ that contains a permutation of the integers from 1 to $n$.

$\mathrm{with}\left(\mathrm{Iterator}:-\mathrm{Inversion}\right)\:$

$c≔\left[0\,0\,1\,2\right]$

$c≔\left[0\,0\,1\,2\right]$

$a≔\mathrm{RightInversionToPermutation}\left(c\right)$

$a≔\left[\begin{array}{cccc}1& 4& 3& 2\end{array}\right]$

$\mathrm{PermutationToRightInversion}\left(a\right)$

$\left[\begin{array}{cccc}0& 0& 1& 2\end{array}\right]$

The Iterator[Inversion][RightInversionToPermutation] command was introduced in Maple 2016.

For more information on Maple 2016 changes, see Updates in Maple 2016.