I am in need of an algorithm to return an array of ALL unique subsets of n params. For instance in a set where n = 3 the return values would be:
I sure wish I would have paid more attention in math class all those years ago
Original set 1,2,3
[none]
123
1
2
3
12
13
23
Here is what I know (think I know):
1.The algorithm will be recursive.
2.The algorithm will be exponential in complexity/passes for each increase in initial population.
Any and all coments are greatly appreciated.
I sure wish I would have paid more attention in math class all those years ago
Original set 1,2,3
[none]
123
1
2
3
12
13
23
Here is what I know (think I know):
1.The algorithm will be recursive.
2.The algorithm will be exponential in complexity/passes for each increase in initial population.
Any and all coments are greatly appreciated.