- Write an algorithm for power set of {a,b,c}. hint: 2^n complexity and subsets.
Sigiloso
think of combinations of binary number of size 3. {000, 010, ... 111} map each corresponding bit to letter. for the corresponding bit position "0" means letter absent and " "1" means present. 010 = b ; 101=ac