collaborators

1 paper

math.CO2004

Comparing algorithms for sorting with t stacks in series

Rebecca Smith

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…