On Sep 3, 4:24 pm, Miki <miki.teb...@gmail.com> wrote: > > Fannkuch has required the permutations to be generated in a particular > > order for years because too many programmers contributed programs that > > did not generate some of the permutations or used faster algorithms to > > generate the permutations. > > I've read several implementation so far and I'm still not clear about > the exact algorithm used to generate the permutations.
We all struggle with that same problem because the algorithm was taken from program source code in the paper "Performing Lisp Analysis of the FANNKUCH Benchmark". The Lua program provides a succinct implementation, lines 29 through 42 http://shootout.alioth.debian.org/u32/program.php?test=fannkuchredux&lang=lua&id=1 If you find Lisp easier to read then take a look at the deprecated fannkuch program - http://shootout.alioth.debian.org/gp4/program.php?test=fannkuch&lang=sbcl&id=2 -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
