{menu}

Fundamental Algorithm Analysis

Head Permutations Using a Linear Array of 3 Letters
EXAMPLE_01 Output where N = 3
Sequence Output Indexes Swapped
1 A B C No Swap
2 B A C swapped(0, 1)
3 C A B swapped(0, 2)
4 A C B swapped(0, 1)
5 B C A swapped(0, 2)
6 C B A swapped(0, 1)

Click here to return to EXAMPLE_01 - Alpha.




[New Book: Practical Permutations]

[QuickPerm] | [EXAMPLE 02] | [EXAMPLE 03] | [EXAMPLE 04] | [MetaPerm]
[Download the Five C++ Examples] | [Permutation Exercises]
[Contact the Author] | [Make a Donation] | [Links]
[HOME]

Help keep public education alive! We need your donations, click here to help now...

{top}

Copyright © 2010 by Phillip Paul Fuchs, all rights reserved.
Abstracting with credit is permitted...