The Johnson-Trotter algorithm is an algorithm for figuring out permutations given a value set. A permutation is a way of altering the values in a set to create a different unique sequence from the original. If we have the set 1, 2, 3, 4, 5... one permutation would be 2, 1, 4, 5, 3 and another would be 3, 4, 2, 1, 5. Using a quirky little algorithm, we can ...
Ok, maybe the topic is a little tough but the general idea is pretty sound. Recently I had the pleasure of helping someone on DIC with a VC++ project and decided to whip up something in the latest VS 2005. Now granted much my experience in VC++ was pre 2005 CLI so I was completely blown away with the syntax changes they made using the Common language Infrastructure (CLI) to ...
