the paper i posted uses Haskell, no mutation or looping. it also uses Haskell's lazyness in a neat way.
bye iavor
Weix, Rachel Lynn wrote:
I have since been able to figure out my problems - the algorithm for one of my methods was wrong and I found two "typos" so to speak. I now need to figure out how to return all optimal solutions, and I have an idea as to how to start. If I have any more problems I may send out another email.
Rachel
P.S. I need to solve the problem using functional programming, thus I cannot use looping structures or mutation.
-- ================================================== | Iavor S. Diatchki, Ph.D. student | | Department of Computer Science and Engineering | | School of OGI at OHSU | | http://www.cse.ogi.edu/~diatchki | ==================================================
_______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
