2010-09-28, 07:36 PM
Okay. Suppose you have some arbitrary pairing of men. Now suppose you sort the men in some particular order (say alphabetical; it doesn't matter). There will be only one way to permute the women so that their order matches up with the men, do you agree? Such that the first man is paired with the first woman, and so on down the line.
So if you fix the order of the men constant and just recurse through all possible permutations of women, you will have looped through all possible pairings of all the men and women.
Does that make sense?
So if you fix the order of the men constant and just recurse through all possible permutations of women, you will have looped through all possible pairings of all the men and women.
Does that make sense?