Correctness proof of an in-place permutation

A.J.W. Duijvestijn

    Research output: Contribution to journalArticleAcademic

    2 Citations (Scopus)
    83 Downloads (Pure)


    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.
    Original languageUndefined
    Pages (from-to)318-324
    JournalBIT (Nordisk Tidskrift for Informationsbehandling)
    Issue number3
    Publication statusPublished - 1972


    • IR-85477

    Cite this