[ale] a math/cs question

[jim.kinney at gmail.com (Jim Kinney)]

You only need one bucket. As there is no definition of variation between
balls that requires a sort, get a BIG bucket.

(so sayeth the physicist)

2008/4/17 Jerry Yu <jjj863 at gmail.com>:

> Given a varying # of bags, each containing a varying # of  golf balls.
> what's the best/practical algorithm to sort these bags to the fewest
> buckets. The buckets can hold varying # of golf balls. assume bags don't
> consume space.
> If the actual # matters,   assume  5~20 bags, 10~500 balls per bag,
> 500~600 balls per bucket.
>
> I thought some one  else on the list asked for similar things for  backup
> grouping. couldn't find in my own ALE archive in gmail :(
>
>
> _______________________________________________
> Ale mailing list
> Ale at ale.org
> http://mail.ale.org/mailman/listinfo/ale
>
>


-- 
-- 
James P. Kinney III
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mail.ale.org/pipermail/ale/attachments/20080417/915d3d4e/attachment.html