Comparing Algorithms for Sorting with <Emphasis Type="Italic">t</Emphasis> Stacks in Series |
| |
Authors: | Email author" target="_blank">Rebecca?SmithEmail author |
| |
Institution: | (1) Department of Mathematics, University of Florida, 32611-8105 Gainesville, FL, USA |
| |
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.AMS Subject Classification: 05A05, 68R05, 68W01. |
| |
Keywords: | permutations stack sorting sorting in series |
本文献已被 SpringerLink 等数据库收录! |