Sets generation

Given a set of distinct integers, S, return all possible subsets.

Note:

• Elements in a subset must be in non-descending order.
• The solution set must not contain duplicate subsets.

For example,
If S = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

void generateSubSets(vector<int> &S, int currentIndex, vector<int> currentSet, vector<vector<int> > &result)
{
  if(currentIndex >= S.size())
  {
   result.push_back(currentSet);
   return;
  }

  generateSubSets(S, currentIndex + 1, currentSet, result);
  currentSet.push_back(S[currentIndex]);
  generateSubSets(S, currentIndex + 1, currentSet, result);

}

 vector<vector<int> > subsets(vector<int> &S) {
              vector<vector<int> > result;
     if(S.size() <= 0 )
     {
      return result;
     }

     sort(S.begin(), S.end());
     vector<int> currentSet;
     generateSubSets(S, 0, currentSet, result);
     return result;
}