Created
May 22, 2011 06:54
-
-
Save sattvikc/985237 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def fact(n): | |
| if(n <= 1): | |
| return 1 | |
| else: | |
| return n*fact(n-1) | |
| def GeneratePermutation(n, k, i): | |
| numberSet = range(1, n+1) | |
| permutation = [] | |
| elementsLeft = n | |
| while(len(permutation) < k): | |
| permutation += [numberSet[i % elementsLeft]] | |
| numberSet.remove(numberSet[i % elementsLeft]) | |
| i /= elementsLeft | |
| elementsLeft -= 1 | |
| return permutation | |
| def GenerateAllPermutations(n, k): | |
| permutationCount = fact(n) / fact(n-k) | |
| i = 0 | |
| while i < permutationCount: | |
| print GeneratePermutation(n, k, i) | |
| i += 1 | |
| return permutationCount | |
| print "Permutations for 6 P 3" | |
| print GenerateAllPermutations(6, 3), "permutations generated!" |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment