[Haskell-cafe] Programming Chalenges: The 3n+1 problem

[Dmitri O.Kondratiev]

Thanks, Felipe!
Sure I will try to code solution myself. Doing it all by yourself is the
main fun of everything, isn't it?
I was just asking about the *idea* of implementing cache in Haskell, in
general, not just in this case only.

On Thu, Apr 14, 2011 at 3:11 PM, Felipe Almeida Lessa <
felipe.lessa at gmail.com> wrote:

> This is very similar to the Problem 14 on Project Euler [1].  Should
> you really want a nice solution in Haskell, and noting that this is a
> big spoiler, there are some on the wiki [2].  But I highly recommend
> you to try coding your own solutions before looking at the site =).
>
> Cheers!
>
> [1] http://projecteuler.net/index.php?section=problems&id=14
> [2] http://www.haskell.org/haskellwiki/Euler_problems/11_to_20#Problem_14
>
> --
> Felipe.
>


-- 
All the best,
Dmitri O. Kondratiev

"This is what keeps me going: discovery"
dokondr at gmail.com
http://sites.google.com/site/dokondr/welcome
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110414/88c0a231/attachment.htm>