In-situ inversion of a cyclic permutation

W.H.J. Feijen; A.J.M. Gasteren, van; D. Gries

doi:10.1016/0020-0190(87)90192-X

In-situ inversion of a cyclic permutation

W.H.J. Feijen, A.J.M. Gasteren, van, D. Gries

Research output: Contribution to journal › Article › Academic › peer-review

5 Citations (Scopus)

Abstract

An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.

Original language	English
Pages (from-to)	11-14
Journal	Information Processing Letters
Volume	24
Issue number	1
DOIs	https://doi.org/10.1016/0020-0190(87)90192-X
Publication status	Published - 1987

Access to Document

10.1016/0020-0190(87)90192-X

Cite this

@article{69d76787591b40de80496a0fa521e8d4,

title = "In-situ inversion of a cyclic permutation",

abstract = "An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.",

author = "W.H.J. Feijen and \{Gasteren, van\}, A.J.M. and D. Gries",

year = "1987",

doi = "10.1016/0020-0190(87)90192-X",

language = "English",

volume = "24",

pages = "11--14",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - In-situ inversion of a cyclic permutation

AU - Feijen, W.H.J.

AU - Gasteren, van, A.J.M.

AU - Gries, D.

PY - 1987

Y1 - 1987

N2 - An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.

AB - An algorithm is developed for the in-situ inversion of a cyclic permutation represented in an array. The emphasis is on the quo modo rather than the quod**; we are interested in finding concepts and notations for dealing more effectively with formal developments and proofs of such algorithms, rather than in this particular algorithm itself.

U2 - 10.1016/0020-0190(87)90192-X

DO - 10.1016/0020-0190(87)90192-X

M3 - Article

SN - 0020-0190

VL - 24

SP - 11

EP - 14

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

In-situ inversion of a cyclic permutation

Abstract

Access to Document

Fingerprint

Cite this