Generating list out of pairs
I have pairs (a1,b1) , (a2, b2) ..... (an,bn) I want to generate all the
2^n lists. With recursion this is easy and is like finding all
permutations of string however I want to do it iteratively. Please suggest
me a way to do this.
No comments:
Post a Comment