

I had been doing some work that required knowing how many permutations there
were of a set containing N elements.
That can be done with Heap's algorithm.
(I used the nonrecursive version, because the recursive one was way too
confusing, and I couldn't get it to work)
I decided to see what that would look like using colors.
<0, 0, 0>, x, y, z, x+y, x+z, y+z, <1, 1, 1> has 40320 permutations.
And with sphere radii of 0.75, they just barely fit into a 1920 x 1080 render.
 BW
Post a reply to this message
Attachments:
Download 'permutations.png' (3080 KB)
Preview of image 'permutations.png'

