You only need one bucket. As there is no definition of variation between balls that requires a sort, get a BIG bucket.<br><br>(so sayeth the physicist)<br><br><div class="gmail_quote">2008/4/17 Jerry Yu <<a href="mailto:jjj863@gmail.com">jjj863@gmail.com</a>>:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">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.<br>
If the actual # matters, assume 5~20 bags, 10~500 balls per bag, 500~600 balls per bucket.<br><br>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 :(<br>
<br>
<br>_______________________________________________<br>
Ale mailing list<br>
<a href="mailto:Ale@ale.org">Ale@ale.org</a><br>
<a href="http://mail.ale.org/mailman/listinfo/ale" target="_blank">http://mail.ale.org/mailman/listinfo/ale</a><br>
<br></blockquote></div><br><br clear="all"><br>-- <br>-- <br>James P. Kinney III <br>