Suppose we need to write a function that gives the list of all the subsets of a set. The function and the doctest is given below. And we need to complete the whole definitio
The usual implementation of powerset on list goes something like this:
list
def powerset(elements): if len(elements) > 0: head = elements[0] for tail in powerset(elements[1:]): yield [head] + tail yield tail else: yield []
Just needs a little bit of adaptation to deal with set.
set