On Sun, Feb 27, 2011 at 3:08 AM, Mike Miller <mbmiller+l at gmail.com> wrote: > > > It isn't very efficient, though. It took 13 minutes on my machine. > That's part of the fun of it. There are multiple twists you can add for fun. 1) Choosing the best language for a particular problem. 2) Commit to solving in a particular language for the fun of overcoming the challenges that presents (like bash, or lisp, or erlang, or asm, etc...) 3) Finding a solution that is computationally more efficient. i.e., O(N^2) solution is readily apparent. Might there be an O(N) or O(nlogn) approach that exploits underlying properties? -Rob -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mailman.mn-linux.org/pipermail/tclug-list/attachments/20110227/4880b9b9/attachment.html>