[Haskell-cafe] Coin changing algorithm
Dinh Tien Tuan Anh
tuananhbirm at hotmail.com
Wed Jul 13 11:47:18 EDT 2005
it's because of the impreative approach. Seem more elegent than a functional
Where is the best place to find out about Monads. The book by Richard Bird
is pretty confusing.
>From: Radu Grigore <radugrigore at gmail.com>
>Reply-To: Radu Grigore <radugrigore at gmail.com>
>To: Dinh Tien Tuan Anh <tuananhbirm at hotmail.com>
>CC: kelanslists at gmail.com, haskell-cafe at haskell.org
>Subject: Re: [Haskell-cafe] Coin changing algorithm
>Date: Wed, 13 Jul 2005 18:41:41 +0300
>On 7/13/05, Dinh Tien Tuan Anh <tuananhbirm at hotmail.com> wrote:
> > i guess i have to learn Monads then, ^_^
>That's probably a good idea. But what about this problem made you
>think "monads"? Caching? The imperative solution you mentioned?
It's fast, it's easy and it's free. Get MSN Messenger 7.0 today!
More information about the Haskell-Cafe