I have (what I think are) several examples of this type of thing posted:
But sometimes you don't need a closure. Permuting with duplicates and no memory uses a single array as the initial input, the output, and the context (which is part of why it is one of my favorites).
- tyeIn reply to Re: Recursive to Iterative using Closures (Fun with Fibonacci) (examples)
by tye
in thread Recursive to Iterative using Closures (Fun with Fibonacci)
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |