Write a static recursive method in Java called mRecursion that displays all of the permutations of the characters in a string passed to the method as its argument. For example, the character sequence abc has the following permutations: acb, bac, bca, cab, cba. Then Write a static method called getInput that get an input string from the user and passed it to the mRecursion method written above in a method call. Please does so using what I already had
Write a static recursive method in Java called mRecursion that displays all of the permutations of the characters
in a string passed to the method as its argument. For example, the character sequence abc has the
following permutations: acb, bac, bca, cab, cba.
Then Write a static method called getInput that get an
input string from the user and passed it to the mRecursion method written above in a method call.
Please does so using what I already had
//Get input from in to call recursive method
//to display those char permutations
public static String getInput ( ) {
Scanner in = new Scanner(System.in);
String combination = in.nextLine();
System.out.println("Enter string:);
return stringComb;
//Method to show permutations of a desired string
// This only return 3 string combination for some reason
static void myRecursion(String aString) {
//isEmpty check
if ( aString.length() == 0){
System.out.println("Empty String: ");
}
for (int i = 0; i < comb.length(); i++) {
char n = aString.charAt(i);
String toPermute = aString.substring(0, i)+(aString.substring(i+1));
System.out.println(toPermute + ("" +n));
public static void main ( String[] args ) { String word; word = getInput(); myRecursive(word); }
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
