Permutations of a given string

 Permutations of a given string 

Q - Permutations of a given string

Given a string S. The task is to print all permutations of a given string.

Input:
The first line of input contains an integer T, denoting the number of test cases. Each test case contains a single string S in capital letter.

Output:
For each test case, print all permutations of a given string S with single space and all permutations should be in lexicographically increasing order.

Constraints:
1 ≤ T ≤ 10
1 ≤ size of string ≤ 5

Example:
Input:
2
ABC
ABSG

Output:
ABC ACB BAC BCA CAB CBA 
ABGS ABSG AGBS AGSB ASBG ASGB BAGS BASG BGAS BGSA BSAG BSGA GABS GASB GBAS GBSA GSAB GSBA SABG SAGB SBAG SBGA SGAB SGBA

Explanation:
Testcase 1: Given string ABC has permutations in 6 forms as ABC, ACB, BAC, BCA, CAB and CBA .

SOLUTION

#include < iostream >

    using namespace std;

void permutation(string s, int i){

    //base Case

    if (s[i] == '\0') {

        cout << s << " ";

        return;

    }

    //recursive case

    for (int j = i; s[j] != '\0'; j++) {

        swap(s[i], s[j]);

        permutation(s, i + 1);

        swap(s[i], s[j]);

    }

}

int main()

{

    //code

    int t; cin >> t;

    while (t--) {

        string S;

        cin >> S;

        permutation(S, 0);

        cout << endl;

    }

    return 0;

}