recursive permute function (looking for a different version)

[adam50]

Hi, I'm a beginner at c++. The following code outputs first string plus all possible permutations of the second string. I'm looking to produce the permutations of first string(instead of second) plus the second string. How can I do that?

  void permute(string prefix, string rest)
{
	
	if (rest == "")
	{
		cout << prefix << endl;
	}
	else
	{
		for (int i = 0; i < rest.length(); i++)
		{
			//test if rest[i] is unique.
			bool found = false;
			for (int j = 0; j < i; j++)
			{
				if (rest[j] == rest[i])
					found = true;
			}
			if (found)
				continue;
			string newPrefix = prefix + rest[i];
			string newRest = rest.substr(0, i) + rest.substr(i + 1);
			permute(newPrefix, newRest);

		}

	}
}

int main()
{
	permute("TO", "MAC");
	return 0;
}

[lastchance]

Swap the words prefix and rest.

#include<iostream>
#include<string>
using namespace std;


void permute(string prefix, string rest)
{
        
        if (prefix == "")
        {
                cout << rest << endl;
        }
        else
        {
                for (int i = 0; i < prefix.length(); i++)
                {
                        //test if prefix[i] is unique.
                        bool found = false;
                        for (int j = 0; j < i; j++)
                        {
                                if (prefix[j] == prefix[i]) found = true;
                        }
                        if (found) continue;
                        string newRest = prefix[i] + rest;
                        string newPrefix = prefix.substr(0, i) + prefix.substr(i + 1);
                        permute(newPrefix, newRest);

                }

        }
}

int main()
{
        cout << "\nCheck original" << endl;
        permute("MAC", "TO");

        cout << "\nCheck repetition" << endl;
        permute("LOOT", "ABC");
        return 0;
}

[adam50]

Thanks :)