[Haskell-cafe] For Project Euler #24 you don't need to generate all the lexicographic permutations Spoiler

For Project Euler #24 you don't need to generate all the lexicographic permutations by Knuth's method or any other. You're only looking for the millionth lexicographic permutation of 0123456789 Problem 24 A permutation is an ordered arrangement of objects. For example, 3124 is one

Re: [Haskell-cafe] For Project Euler #24 you don't need to generate all the lexicographic permutations Spoiler

On Sun, May 8, 2011 at 10:41 AM, cas...@istar.ca wrote: For Project Euler #24 you don't need to generate all the lexicographic permutations by Knuth's method or any other. This is a clever, smart solution. You should post it to the Haskell Wiki page [0]. [0]

Re: [Haskell-cafe] For Project Euler #24 you don't need to generate all the lexicographic permutations Spoiler

I see from the solutions on Project Euler others did think of this way but at least on my last IQ test I did get an 'A'; 95. I am a jenius. :D -- -- Regards, KC ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org