User:Eriksiers/Knapsack problem: Difference between revisions

Newer edit →

Content deleted Content added

Inline

Revision as of 18:02, 22 September 2010 view source Eriksiers (talk \| contribs) 1,150 edits created! not working! whatever!		Revision as of 02:01, 10 November 2010 view source Eriksiers (talk \| contribs) 1,150 edits m clarify Newer edit →
Line 1:		Line 1:
	This is my working version of another VB solution to the [[Knapsack problem/Unbounded\|unbounded knapsack problem]]. (The actual solution is [[Knapsack Problem/Visual Basic]].) I didn't base this version on the one that's posted; I wanted to do it all on my lonesome. It's significantly shorter than the actual solution, ''but...''		This is my not-quite-working version of another VB solution to the [[Knapsack problem/Unbounded\|unbounded knapsack problem]]. (The actual solution is [[Knapsack Problem/Visual Basic]].) I didn't base this version on the one that's posted; I wanted to do it all on my lonesome. It's significantly shorter than the actual solution, ''but...''

	I didn't put it up there because there's something not quite right here; it goes over the limits by one panacea and one gold. Also, it picks the first version that works, and doesn't list ''all'' solutions (but I think I could handle that in just a few lines.) Also also, it doesn't go through all permutations of the list.		I didn't put it up there because there's something not quite right here; it goes over the limits by one panacea and one gold. Also, it picks the first version that works, and doesn't list ''all'' solutions (but I think I could handle that in just a few lines.) Also also, it doesn't go through all permutations of the list.