The correctness of an in-place permutation algorithm is proved. The algorithm exchanges elements belonging to a permutation cycle. A suitable assertion is constructed from which the correctness can be deduced after completion of the algorithm. An in-place rectangular matrix transposition algorithm is given as an example.
|Journal||BIT (Nordisk Tidskrift for Informationsbehandling)|
|Publication status||Published - 1972|