Comparing algorithms for sorting with t stacks in series
Combinatorics
2007-05-23 v2
Abstract
We show that the left-greedy algorithm is a better algorithm than the right-greedy algorithm for sorting permutations using t stacks in series when t>1. We also supply a method for constructing some permutations that can be sorted by t stacks in series and from this get a lower bound on the number of permutations of length n that are sortable by t stacks in series. Finally we show that the left-greedy algorithm is neither optimal nor defines a closed class of permutations for t>2.
Keywords
Cite
@article{arxiv.math/0404176,
title = {Comparing algorithms for sorting with t stacks in series},
author = {Rebecca Smith},
journal= {arXiv preprint arXiv:math/0404176},
year = {2007}
}
Comments
9 pages, 7 figures, To be published in Annals of Combinatorics. The new version makes a few grammatical changes, clarifies a definition, and fixes the figures