On Thu, 2 Jan 2003 16:25:38 +0000 (UTC), steve@watchfield.com wrote:
> --- Steve's Very Silly Pop-11 Programming Challenge 2003 ---
>
>Implement a PERMUTATION REPEATER. Given a data structure of your
>choice (string, list, vector, all of the previous), return a
>procedure that when called repeatedly returns permutations of the
>original. Although the order of the permutations returned there
>should be no repeats and every possible permutation should be
>returned, eventually.
Aha!
>Points will be awarded by me for
> 1. Correctness, because this is not a C programming challenge.
> 2. Beauty.
> 3. Efficiency - in both time and space.
> 4. Generality. Super bonus points for handling dynamic lists.
> 5. Showing off, rule bending, cheating, etc.
What about:
0. Amount of time spent coding your solution.
This is relevant, because I suspect I can find several examples in
my library, so coding time would be zero ... ;-).
I think 3 should be split into 3a time and 3b space - we are not all
Einsteins, you know!
Jonathan
--
Use jlc instead of netspam to e-mail me, please.
|