Sorting arrays by means of swaps

N.G. Bruijn, de

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of swaps is treated in this paper. In particular it is shown that if a sequence of "miniswaps" sorts the worst possible arrangement of an array, then it sorts every arrangement of that array. The case of permutation arrays was treated before by R.W. Floyd.
Original languageEnglish
Pages (from-to)125-132
JournalIndagationes Mathematicae (Proceedings)
Volume86
Issue number2
DOIs
Publication statusPublished - 1983

Fingerprint Dive into the research topics of 'Sorting arrays by means of swaps'. Together they form a unique fingerprint.

Cite this