Suppose we have an ordered sequence $1,2,..,n$. ↵
↵
We also have a stack. We will be using this stack to try to obtain different permutations of this sequence.↵
↵
At any time we may either 1) push the front of our ordered sequence onto the stack or 2) pop the top of the stack and append it to our resulting permutation.↵
↵
↵
Which permutations of the original sequence can be obtained by such a process?↵
↵
(I ask because many programming puzzles seem to be built around this question).↵
↵
So for example if the starting sequence is $1,2,3$ we can obtain all permutations except $32112$. ↵
↵
But what is the answer in general?
↵
We also have a stack. We will be using this stack to try to obtain different permutations of this sequence.↵
↵
At any time we may either 1) push the front of our ordered sequence onto the stack or 2) pop the top of the stack and append it to our resulting permutation.↵
↵
↵
Which permutations of the original sequence can be obtained by such a process?↵
↵
(I ask because many programming puzzles seem to be built around this question).↵
↵
So for example if the starting sequence is $1,2,3$ we can obtain all permutations except $3
↵
But what is the answer in general?
