Permutation algorithm without recursion? Java

by

You should use the fact that when you want all permutations of N numbers there are N! possibilities. Therefore each number x from 1..N! encodes such a permutation. Here is a sample that iteratively prints out all permutations of a sting. 

private static void printPermutationsIterative(String string){
        int [] factorials = new int[string.length()+1];
        factorials[0] = 1;
        for (int i = 1; i<=string.length();i++) {
            factorials[i] = factorials[i-1] * i;
        }

        for (int i = 0; i < factorials[string.length()]; i++) {
            String onePermutation="";
            String temp = string;
            int positionCode = i;
            for (int position = string.length(); position > 0 ;position--){
                int selected = positionCode / factorials[position-1];
                onePermutation += temp.charAt(selected);
                positionCode = positionCode % factorials[position-1];
                temp = temp.substring(0,selected) + temp.substring(selected+1);
            }
            System.out.println(onePermutation);
        }
    }

More Related Contents:

  1. Generating all permutations of a certain length
  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. Recursive method for 2,4,8,..in 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. Hibernate JPA Sequence (non-Id)
  12. Reversing a linked list in Java, recursively
  13. Java recursive Fibonacci sequence
  14. Reversing a String with Recursion in Java
  15. Generating all possible permutations of a list recursively
  16. Why does the count of calls of a recursive method causing a StackOverflowError vary between program runs? [duplicate]
  17. Recursive ConcurrentHashMap.computeIfAbsent() call never terminates. Bug or “feature”?
  18. How to generate a random permutation in Java?
  19. MappedSuperclass – Change SequenceGenerator in Subclass
  20. The difference between head & tail recursion [duplicate]
  21. Recursive Fibonacci memoization
  22. Finding Max value in an array using recursion
  23. How does recursion work? [closed]
  24. Permutation algorithm for array of integers in Java
  25. Breaking out of a recursion in java
  26. Counting nodes in a tree in Java
  27. HQL recursion, how do I do this?
  28. java.lang.StackOverflowError due to recursion
  29. How to deep copy a Binary Tree?
  30. Recursion in JSF (c:forEach vs. ui:repeat)

Leave a Comment