Iterate once and only once through all the possible configurations of an array

[jeremydouglass]

all the possible configurations of an array

If by this you mean all the permutations, then check out Heap’s algorithm – and a recent implementation posted to the forum, here:

Storing all index permutations with Heap's algorithm

Hi, I am new on Processing and I am struggling with Java. I am trying to use Heap’s algorithm to get the list of all the permutations of numbers. I want to store that list so I wan use it as a matrix for animation. I have tried many different ways and types but I can’t fill it correctly. As I am stuck, I would appreciate some help. Here what I have: // https://en.wikipedia.org/wiki/Heap%27s_algorithm#Details_of_the_algorithm void heapPermutations(int k, IntList l, ArrayList<IntList> a) { …