|
> -----Original Message----- > From: rpg400-l-bounces@xxxxxxxxxxxx / CWilt@xxxxxxxxxxxx > Sent: Wednesday, September 22, 2004 12:15 PM > > Did my post of the "n choose k" algorithm help any? Oh, yes, that clarified *everything*! <tongue-in-cheek> Man, my head hurt after reading that one, Charles! <g> Based on someone else's pointer on "NP complete", I found the following link that seemed to be very specific to the problem I was attempting to solve: http://en.wikipedia.org/wiki/Subset_sum_problem All of this was interesting reading (!?!?!), but after such a long time, I am far enough removed from all those high-level mathematics courses that I'd have to do a serious review of the textbooks I kept from way back when. So, my "method" to solve the problem was to lay out the desired results and develop the algorithm to accomplish that. db
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2025 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
