The power set of a set is the set of all its subsets. Write a function that, given a set, generates its power set. For example, given the set {1, 2, 3}, it should return {{}, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}.

daily-coding-problem-37.rb

#!/usr/bin/env ruby

def power_set(set)
    size = set.size() ** 2
    size.times do |counter|
        size.times do |j|
            if ((counter & (1 << j)) > 0)
               print set[j]
            end    
        end 
        print "\n"
    end
end 

set = ['A','B','C']
power_set(set)