Sorting with a forklift

Details Sorting with a forklift Sorting with a forklift

2002-09-10

arxiv.org/abs/cs/0209016v1

Computer Science

Discrete Mathematics

24 pages, 2 figures

Scientific paper

A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single forkstack, or dually, which permutations of a fixed input stream can be produced using a single forkstack. An algorithm is given to solve the sorting problem and the minimal unsortable sequences are found. The results are extended to fork stacks where there are bounds on how many items can be pushed and popped at one time. In this context we also establish how to enumerate the collection of sortable sequences.

Affiliated with

Also associated with

No associations

Rating

Sorting with a forklift 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 Sorting with a forklift, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting with a forklift will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160093