## Overview

11/9/2016 permutations of an unordered set can be accomplished by taking any item of the collection of words, followed by any non-previous item of any of the previous items, repeated ad infinitum.

Example:

word set: gh ab ef cd by definition, the permutation would be the set itself. maybe that's why it never got out there. I do not remember what a permutation is. my math books are gone, and I am informed I can't look it up in a dictionary (you know you can expand your brain too much guys). and I am not a mathematition. I am a software engineer. unordered combinations for the same set would be below, and you can simply sort the set and try again. permutations: gh ab ef cd gh ab cd ef gh ef ab cd gh ef cd ab gh cd ab ef gh cd ef ab cd gh ab ef cd gh ef ab cd ab ef gh cd ab gh ef cd ef gh ab cd ef ab gh ab gh cd ef ab gh ef cd ab cd ef gh ab cd gh ef ab ef gh cd ab ef cd gh ef ab gh cd ef ab cd gh ef cd gh ab ef cd ab gh ef gh cd ab ef gh ab cd --> 4 sets of 6 permutations which make 24 total.