Write a method to compute all permutations of a string.

Another "Cracking the Coding Interview" question from recursion. Implementation is done with C++.

Code:

#include<iostream>
#include<vector>
using namespace std;
void print_subset(vector<int>& v,int array[],int size,int i)
{
        if(i>=size)
        {
                for(int i=0;i<v.size();++i)
                        cout<<v[i];
                cout<<endl;
                return;
        }
        print_subset(v,array,size,i+1);
        v.push_back(array[i]);
        print_subset(v,array,size,i+1);
        v.pop_back();
}
int main()
{
        int array[3]={1,2,3};
        vector<int> v;
        v.reserve(3);
        print_subset(v,array,3,0);
        return 0;
}