Generating all permutations of a certain length

by

In order to pick five characters from a string recursively, follow a simple algorithm:

  • Your method should get a portion filled in so far, and the first position in the five-character permutation that needs a character
  • If the first position that needs a character is above five, you are done; print the combination that you have so far, and return
  • Otherwise, put each character into the current position in the permutation, and make a recursive call

This is a lot shorter in Java:

private static void permutation(char[] perm, int pos, String str) {
    if (pos == perm.length) {
        System.out.println(new String(perm));
    } else {
        for (int i = 0 ; i < str.length() ; i++) {
            perm[pos] = str.charAt(i);
            permutation(perm, pos+1, str);
        }
    }
}

The caller controls the desired length of permutation by changing the number of elements in perm:

char[] perm = new char[5];
permutation(perm, 0, "abcdefghiklimnop");

Demo.

More Related Contents:

  1. Permutation algorithm without recursion? Java
  2. Java simple recursive function explanation [closed]
  3. Why isn't this work? String value won't change. Recursion [closed]
  4. Find all available combinations
  5. Permutations of integers in Java
  6. how to change code this into recursion Java? [closed]
  7. Operations on Strings
  8. Create lambda function which calculates factorial recursively
  9. Why does this recursive quick sort program not work? [closed]
  10. Recursively list files in Java
  11. Why is the max recursion depth I can reach non-deterministic?
  12. Reversing a String with Recursion in Java
  13. Generating all possible permutations of a list recursively
  14. Factorial using Recursion in Java
  15. Whats the best way to recursively reverse a string in Java?
  16. Is there any way to do n-level nested loops in Java?
  17. Why does the count of calls of a recursive method causing a StackOverflowError vary between program runs? [duplicate]
  18. Recursive ConcurrentHashMap.computeIfAbsent() call never terminates. Bug or “feature”?
  19. How to generate a random permutation in Java?
  20. understanding basic recursion
  21. The difference between head & tail recursion [duplicate]
  22. What is a non recursive solution for Fibonacci-like sequence in Java?
  23. Finding Max value in an array using recursion
  24. How does recursion work? [closed]
  25. Implement recursive lambda function using Java 8
  26. Tail Call Optimisation in Java
  27. The easiest way to remove the bidirectional recursive relationships?
  28. How to flatten all items from a nested Java Collection into a single List?
  29. java.lang.StackOverflowError due to recursion
  30. Recursion in JSF (c:forEach vs. ui:repeat)

Leave a Comment