Created
August 18, 2013 08:57
-
-
Save hectorip/6260644 to your computer and use it in GitHub Desktop.
Algoritmo para obtener todos los subconjuntos de un conjunto
This file contains hidden or 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 getSubsets(conjunto): | |
| subconjuntos=[] | |
| set_size=len(conjunto) | |
| if set_size>1: | |
| subconjuntos+=getSubsets(conjunto[1:]) | |
| elemento=[conjunto[0]] | |
| for sub in subconjuntos[:]: | |
| subconjuntos.append(sub+elemento) | |
| subconjuntos.append(elemento) | |
| else: | |
| subconjuntos+=[conjunto] | |
| #print len(subconjuntos) | |
| #subconjuntos.sort() | |
| return subconjuntos | |
| print getSubsets([i for i in range(20)]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment