String Permutations

Generate all permutations of a string using recursion.

AdvancedTopic: Module 4: String Programs
Back

Java String Permutations Program

This program helps you to learn the fundamental structure and syntax of Java programming.

Try This Code
import java.util.Scanner;

public class Main {
    private static void permute(String s, String prefix) {
        if (s.isEmpty()) {
            System.out.println(prefix);
            return;
        }
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            String rem = s.substring(0, i) + s.substring(i + 1);
            permute(rem, prefix + c);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a string: ");
        String s = sc.nextLine();

        permute(s, "");
        sc.close();
    }
}
Output
Enter a string: abc
abc
acb
bac
bca
cab
cba

Understanding String Permutations

We recursively fix one character at a time and permute the rest.

Note: To write and run Java programs, you need to set up the local environment on your computer. Refer to the complete article Setting up Java Development Environment. If you do not want to set up the local environment on your computer, you can also use online IDE to write and run your Java programs.

Previous
String Compression

Table of Contents