Написать программу которая делает перестановки введенных симолов

#include <iostream>
#include <string>
#include <algorithm>
#include <conio.h>
 using namespace std;
int main () {
 string str ;
 cin >> str ;
 cout << "START:\n";
 sort ( str.begin() , str.end() ) ;
 do {
 cout << str << '\n';
 } while (next_permutation( str.begin() , str.end() ) );
 cout << "END" << endl ;
 _getch();
}

#include <algorithm>
#include <iostream>
#include <iterator>
#include <set>
#include <conio.h>
 using namespace std;
int main()
{
    size_t firstSetSize;
    cout << "Size of the first set: ";
    cin >> firstSetSize;
 
    set <int> firstSet;
    cout << "Input " << firstSetSize << " unique elements: " << endl;
    for (size_t i = 0; i < firstSetSize; i++) {
        int currentSetElement;
        cout << (i + 1) << ") ";
        cin >> currentSetElement;
        if (count(firstSet.begin(), firstSet.end(), currentSetElement)) {
            cout << "This element in not unique! Try again!" << endl;
            i--;
        }
        else {
            firstSet.insert(currentSetElement);
        }
    }
    system("cls");
 
    size_t secondSetSize;
    cout << "Size of the second set: ";
    cin >> secondSetSize;
 
    set <int> secondSet;
    cout << "Input " << secondSetSize << " unique elements: " << endl;
    for (size_t i = 0; i < secondSetSize; i++) {
        int currentSetElement;
        cout << (i + 1) << ") ";
        cin >> currentSetElement;
        if (count(secondSet.begin(), secondSet.end(), currentSetElement)) {
            cout << "This element in not unique! Try again!" << endl;
            i--;
        } else {
            secondSet.insert(currentSetElement);
        }
    }
    system("cls");
 
    cout << "First set: { ";
    copy(firstSet.begin(), firstSet.end(), ostream_iterator <int>(cout, " "));
    cout << "} " << endl;
 
    cout << "Second set: { ";
    copy(secondSet.begin(), secondSet.end(), ostream_iterator <int>(cout, " "));
    cout << "} " << endl;
 
    int minimalOfSecondSet(*min_element(secondSet.begin(), secondSet.end()));
    cout << "Minimal of the second set: " << minimalOfSecondSet << endl;
 
    firstSet.erase(minimalOfSecondSet);
    cout << "First set: { ";
    copy(firstSet.begin(), firstSet.end(), ostream_iterator <int>(cout, " "));
    cout << "} " << endl;
 
    _getch();
   
}

void swp(char* l, char* r){
 *l^=*r^=*l^=*r;
}
void permutations_out(char* str, char* iter=NULL){
  iter=iter?iter:str;
  if (!(*iter)) std::cout<<str<<endl;
  for (char* j=iter; *j;j++){
    swp(iter,j);
    permutations_out(str, iter+1);
    swp(iter, j);
  }
}
int main(){
  char str[30];
  std::cin>>str;
  permutations_out(str);
  return 0;
}