2018-01-29 18:21:41 +0200 | asked a question | Rekursive Generator which fetches a subset of elements on demand i have following Task to solve; write a generator which outputs a Set (M) of Sets(S) with subsets of M from S \ {s] and M and {s} .. sounds weird. what i wrote is: with following test, i can mySet.next() fetch a Set from the Pool of Sets. Now i have a Problem, rewriting that as recursive function. Is that even possible? Please dont send in "perfect solutions", i want to learn how to solve that puzzle by myself. Thank you! |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.