On 3/3/06, adak <[EMAIL PROTECTED]> wrote: > > It COULD BE a knapsack problem, but it SHOULDN'T be a knapsack problem. > Not with a full database!
It is exactly a knapsack problem and nothing else. Did you read the problem carefully like I told you to do? If you still think a database would help, why not show us a little SQL code that will solve the problem easier than dynamic programming on the knapsack problem? > Databases are organized so that this kind of problem, which is common, > gets chewed up and spit out, with ALL the possible answers (no misses), > and no combinatorial nightmare, either. "ALL the possible answers" could be in the trillions for this problem. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
