A factorial-based approach would involve mapping 0.. (n! - 1) to different permutations. A recursive approach (which is what I would use) would involve breaking the problem into isomorphic subproblems ...