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
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
In-place sorting algorithms play an important role in many fields such as very large database system...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
A short swap is an operation that switches two elements that have at most one element in between. In...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
We present and compare four ecient quadratic, comparison-based algorithms for small arrays and (for ...
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
We present three variations of the following new sorting theme: Throughout the sort, the array is ma...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
In-place sorting algorithms play an important role in many fields such as very large database system...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractAs a preparation to the study of a particular sorting machine, the sorting of arrays by sequ...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
A short swap is an operation that switches two elements that have at most one element in between. In...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n...
We present the first in-place algorithm for sorting an array of size n that performs, in the worst c...
We present and compare four ecient quadratic, comparison-based algorithms for small arrays and (for ...
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
We present three variations of the following new sorting theme: Throughout the sort, the array is ma...
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
Sorting permutations by operations such as reversals and block-moves has received much interest beca...
In-place sorting algorithms play an important role in many fields such as very large database system...
this paper, we study the problem of sorting permutations and circular permutations using as few fixe...
DOI
Add to ORKG