[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[ale] a math/cs question
- Subject: [ale] a math/cs question
- From: jjj863 at gmail.com (Jerry Yu)
- Date: Thu, 17 Apr 2008 13:57:28 -0400
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 :(
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mail.ale.org/pipermail/ale/attachments/20080417/15160fe8/attachment.html