note
tadman
It might, but if you're going to evaluate all possibilities,
who cares? As in, if you are worried about a scenario such
as the following, where the 10 gets bagged "solo" despite
there being a -5 farther down the pipeline:
<CODE> ( [ 9 ], [ 10, -5], [ 11 ] )
</CODE>
Then later on you will inevitably evaluate a scenario where
the -5 is inserted earlier.
<CODE> ( [ 9, -5, 10 ], [11] )
</CODE>
So, taking the "brute force" approach, you might lose points
for style, but you get the job done, no?
<BR>
<BR>
Has anyone ever pointed out to a grocery checker that
the bagging problem was NP-complete? The result might be
similar to explaining that dogs can solve quadratic equations
(i.e. capturing a frisbee in a parabolic arc while in linear
motion).
82512
82608