Enumerate all possible subsets of a set.

EnumerateSets.cpp

#include <iostream>
#include <vector>
using namespace std;
void enumerate(vector<int> arr){
  for(int current_set = 0; current_set < (1<<(arr.size()-1)); current_set++){
    for(int j=0; j<arr.size(); j++){ // j is the position in arr.
      if (current_set & (1<<j)){ // if the bit is set in this set, then arr[j] is in the set
        cout<<arr[j]<<',';
      }
    }
    cout<<endl;
  }
}
int main(){
}