I submitted it half-jokingly, but I figured the dataset was small enough that it'd still complete, and the comic makes it a little more fun to dig into. It's also a nice example of NP-complete and the knapsack problem for those not familiar.
Thanks,
Ryan Davis Acceleration.net Director of Programming Services 2831 NW 41st street, suite B Gainesville, FL 32606
Office: 352-335-6500 x 124 Fax: 352-335-6506
Larry Clapp wrote:
On Wed, Jul 11, 2007 at 04:07:53PM -0500, Ivan Salazar wrote:
OK, was this quiz a joke then? u_u
Well, I didn't propose it. I don't know what the guy who suggested it had in mind, one way or the other.
I initially thought it would be a hard problem (or at least take a long time to solve), thus my cautionary remarks, but the solution posted here earlier took ~0.001 seconds on my machine. I guess this dataset was sufficiently small. :)
-- L
quiz mailing list quiz@common-lisp.net http://common-lisp.net/cgi-bin/mailman/listinfo/quiz