Write and display count of all permutation of string without using any built in functions. ons usin a program to input string Example Input: ABC Example Output: 6 Explaination: Total Permutation of the string can be: ABC ACB BAC BCA CAB CBA And their count is 6 which is why answer is 6
Answers
Answer:
6
Explanation:
Write and display count of all permutation of string without using any built in functions. ons usin a program to input string Example Input: ABC Example Output: 6 Explaination: Total Permutation of the string can be: ABC ACB BAC BCA CAB CBA And their count is 6 which is why answer is 6
To display and write the count of all permutations of string without using any built-in functions. Is explained using a program to an input string
public class numbers
{
public static void main(String[] args)
{
String str = "ABC";
int n = str.length();
numbers permutation = new Permutation();
permutation.permute(str, 0, n-1);
}
private void permute(String str, int l, int r)
{
if (l == r)
System.out.println(str);
else
{
for (int i = l; i <= r; i++)
{
str = swap(str,l,i);
permute(str, l+1, r);
str = swap(str,l,i);
}
}
}
public String swap(String a, int i, int j)
{
char temp;
char[] charArray = a.toCharArray();
temp = charArray[i] ;
charArray[i] = charArray[j];
charArray[j] = temp;
return String.valueOf(charArray);
}
}