Creating a permutation function

[Sathed]

I'm creating a method to calculate all possible permutations of a string. I know the problem is with my for loop, but I don't know where to go next. I'm not looking for a straight up answer, just to be pointed in the right direction. My method is below.

vector <string> getPerm(string w)
{
    vector<string> v;
    if(w.length() <= 1)
    {
        v.push_back(w);
        return v;
    }
    else
    {
        for(int i = 1; i < w.size(); i++)
	{
	    return getPerm(w.substr(1));
	}
    }
}

I need to return all possible permutations in a vector. My professor didn't show us his code, but he said his method was only about 15 lines.

[tntxtnt]

use the next_permutation function in STL Algorithms?

http://www.cplusplus.com/reference/algorithm/next_permutation/

[Sathed]

@tntxtnt: The point is for me to write it myself.