[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[ale] a math/cs question
- Subject: [ale] a math/cs question
- From: james.sumners at gmail.com (James Sumners)
- Date: Thu, 17 Apr 2008 14:47:56 -0400
- In-reply-to: <[email protected]>
- References: <[email protected]>
http://en.wikipedia.org/wiki/Pigeonhole_principle +
http://en.wikipedia.org/wiki/Addition_principle = Pain In The Ass
What you are asking about is a combinatorics problem. I _barely_
passed that class. I don't like counting.
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 :(
--
James Sumners
http://james.roomfullofmirrors.com/
"All governments suffer a recurring problem: Power attracts
pathological personalities. It is not that power corrupts but that it
is magnetic to the corruptible. Such people have a tendency to become
drunk on violence, a condition to which they are quickly addicted."
Missionaria Protectiva, Text QIV (decto)
CH:D 59