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
Get Them All. Algorithms and Permutations. 333
After Steps 3−4
After Steps 1−2
Start
End
1234
3412
2
1
1
2
4
3
43
Output Deque Input
After Steps 5−6
FIGURE 8.6
Obtaining p = 3412 by a deque.
into the output.
Example 8.32
The permutation 3412 is deque obtainable. See Figure 8.6 for a movement
sequence leading to this permutation.
In order to have an equivalent of Proposition 8.31, we need to define when
we call a permutation general deque-sortable,orgd-sortable,andwhatthe
gd-sorting algorithm is. As the general deque is more flexible a tool than
the stack, we can allow more flexibility in the deque sorting algorithm than
in the stack sorting algorithm. That is, our
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