R. M. Frank
Abstract
In a recent note1, D. L. Shell has described a high-speed sorting procedure for lists contained in internal memory. The method has the great virtues of requiring no additional memory space and being considerably faster than other such methods, which require a time proportional to the square of the list length. The present authors have studied the statistics of Shell's method and have found a minor modification which increases its speed still further.
- 1 D. L. SHELL, Comm. Assoc. comp. Mach. 2, No. 7 (1959), 30-32. Google Scholar
Digital Library
Recommendations
The sorting index and permutation codes
In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic sor, called the sorting ...
Pancake flipping and sorting permutations
In this paper, we study several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding with prefix reversals other similar ...
Tighter upper bound for sorting permutations with prefix transpositions
Permutations are sequences where each symbol in the given alphabet Σ appears exactly once. A transposition is an operation that exchanges two adjacent sublists in a permutation; if one of these sublists is restricted to be a prefix then one obtains a ...
Comments