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
8
Get Them All. Algorithms and
Permutations.
8.1 Generating Permutations
8.1.1 Generating All n-Permutations
If we want to write a computer program to test a conjecture concerning per-
mutations, we need to have an efficient method to generate all n-permutations
for our machine. If the conjecture only concerns permutations with some re-
strictions, we can save a lot of time and effort by having a fast way to generate
only those permutations with the required property.
One can certainly list all permutations lexicographically. That is, let us
define a partial order on the set of all n-permutations as follows. Let p =
p
1
p
2
···p
n
<q
1
q
2
···q
n
if for the smallest
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