I need to use a recursive algorithm to find the power set of a given set i.e a set of all the subsets of a given set.
For example, if a set is {a,b,c}, the power set happens to be a set of {a},{b},{c},{a,b}{a,c},{b,c},{a,b,c}.
I know that such a thread existed earlier on this forum but the solutions were not very elaborate. There were a lot of codes. Can someone instead give me the algorithm instaed of the source code. It will be of great help to me . I am just beginning to learn recursive algorithms