Comparing algorithms for sorting with t stacks in series

Details Comparing algorithms for sorting with t stacks in series Comparing algorithms for sorting with t stacks in series

2004-04-08

arxiv.org/abs/math/0404176v2

Mathematics

Combinatorics

9 pages, 7 figures, To be published in Annals of Combinatorics. The new version makes a few grammatical changes, clarifies a d

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Comparing algorithms for sorting with t stacks in series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comparing algorithms for sorting with t stacks in series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparing algorithms for sorting with t stacks in series will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-158652