----- Original Message ----- From: "Butch Landingin" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]> Sent: Thursday, December 06, 2001 1:04 PM Subject: Re: [plug] Interesting small Math problem
> --- Michael Chaney <[EMAIL PROTECTED]> wrote: > > Here's an even better response from a friend of mine: > > The parse tree representation suggests itself since it is inherently > > recursive, which makes for easy building of larger solutions from > > already computed smaller solutions (a hallmark of dynamic programming). > > Note that building possible parse trees recursively (i.e., "top down") > > is equivalent to brute-force enumeration. > > > > Yep. In an alternative solution, I used a recursive function to > walk through all the possible combinations. (the source code turns out > to be pretty short -- most of the other stuff is simply support code > to handle fractions to make sure no rounding off occurs during > the intermediate calculations). Also, it was written in > python. i hope everything is clear now and i hope you understand why i hate postfix and do it the *other* way. good job butch! kudos to you! ----- Original Message ----- From: "Migs Paraz" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]> Sent: Thursday, December 06, 2001 1:35 PM Subject: Re: [plug] Interesting small Math problem > Wow... can we have a computer science mailing list now? :) yes migz... sacha, you, i and others would love to. :-> to refresh my long drought (seven years or more) in programming and algorithms :-> fooler. _ Philippine Linux Users Group. Web site and archives at http://plug.linux.org.ph To leave: send "unsubscribe" in the body to [EMAIL PROTECTED] To subscribe to the Linux Newbies' List: send "subscribe" in the body to [EMAIL PROTECTED]
