Correctness proof of an in-place permutation

A.J.W. Duijvestijn

doi:10.1007/BF01932303

Correctness proof of an in-place permutation

A.J.W. Duijvestijn

Research output: Contribution to journal › Article › Academic

2 Citations (Scopus)

203 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	318-324
Journal	BIT
Volume	12
Issue number	3
DOIs	https://doi.org/10.1007/BF01932303
Publication status	Published - 1972

Access to Document

10.1007/BF01932303

Duijvestijn72correctnessFinal published version, 270 KB

Cite this

@article{6f3d667784324ee1be77f2c429227c9a,

title = "Correctness proof of an in-place permutation",

abstract = "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.",

author = "A.J.W. Duijvestijn",

year = "1972",

doi = "10.1007/BF01932303",

language = "English",

volume = "12",

pages = "318--324",

journal = "BIT",

issn = "0006-3835",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Correctness proof of an in-place permutation

AU - Duijvestijn, A.J.W.

PY - 1972

Y1 - 1972

N2 - 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.

AB - 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.

U2 - 10.1007/BF01932303

DO - 10.1007/BF01932303

M3 - Article

SN - 0006-3835

VL - 12

SP - 318

EP - 324

JO - BIT

JF - BIT

IS - 3

ER -

Correctness proof of an in-place permutation

Abstract

Access to Document

Fingerprint

Cite this