All the permutations of a given string

Is there a way (in Processing) to find all the permutations of a given string? To be worthwhile, I think the string needs to be at least six characters long.

This could be a candidate for <>. I have found solutions in C++, C, Java, Python, C#, and PHP, but not Processing.

#Heap’s algorithm


Actually, Processing is written as a Java library so there is no “Processing” like version of a code because it’s built on Java.

The nice thing with Processing is that you can display visually how an algorithm works.

This is a similar topic on which I worked before with the Arcane Algorithm Archive on sorting algorithms :