AbstractAs 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
. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
A short swap is an operation that switches two elements that have at most one element in between. In...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
A short swap switches two elements with at most one element caught between them. Sorting permutation...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
18 pages, 5 figuresGeneralizing stack sorting and $c$-sorting for permutations, we define the permut...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
A short swap is an operation that switches two elements that have at most one element in between. In...
As a preparation to the study of a particular sorting machine, the sorting of arrays by sequences of...
AbstractIf π is a permutation of {1,…,n}, then the effect of the swap Sij on π is that the ith and f...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
A miniswap Si,1 ≤ i \u3c n, compares two adjacent keys Пi, Пi+1 in the sequence (П1, ... , Пn), and ...
A short swap switches two elements with at most one element caught between them. Sorting permutation...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
Sorting is one of the fundamental operations in computer science, and many sequential and parallel a...
18 pages, 5 figuresGeneralizing stack sorting and $c$-sorting for permutations, we define the permut...
AbstractIn his Ph.D. thesis, Julian West (Permutations with restricted subsequences and stack-sortab...
AbstractThe permutations that can be sorted by two stacks in series are considered, subject to the c...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
Every permutation of {1, 2, ... , N} can be written as the product of two involutions. As a conseque...
. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
A short swap is an operation that switches two elements that have at most one element in between. In...
DOI
Add to ORKG