Recursive function to generate permutations of all elements of an array

permutations.cpp

void generate_all_permutations(vector<int>& toBePermuted, int nextIndex)
{
  if (nextIndex == toBePermuted.size()){
    print_vector(toBePermuted);
    return;
  }

  for (int i = nextIndex; i < toBePermuted.size(); ++i) {
    swap(toBePermuted[i], toBePermuted[nextIndex]);
    generate_all_permutations(toBePermuted, nextIndex+1);
    swap(toBePermuted[i], toBePermuted[nextIndex]);
  }
}