Skip to Main Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced content levelIntermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
318 Combinatorics of Permutations, Second Edition
1324
4132
4
2
13
13 4 2
1 3 42
3
1 42
3 142
3142
output stack input
FIGURE 8.1
Stack sorting f = 3142.
DEFINITION 8.8 If the output permutation s(p) defined by the above
algorithm is the identity permutation 123 ···n, then we say that p is stack
sortable.
Example 8.9
Figure 8.1 shows the stages of stack-sorting the permutation 3142. We con-
clude that s(p) = 1324, therefore 3142 is not stack-sortable.
If you think that our sorting algorithm is too arbitrary, in that it requires
the entries in the stack to be in increasing order, or that it tells us when
an entry should enter or leave the stack, consider the following. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Introduction to Combinatorics, 2nd Edition

Introduction to Combinatorics, 2nd Edition

Martin J. Erickson

Publisher Resources

ISBN: 9781439850527