Say you have n values with probabilities d_1, ..., d_n.
Normalize your values so that all d_i's are at least 1. Then you can do with
O(sum(d_i)) storage and O(1) time. For each integer l less than sum(d_i)
there is at most one transition from one d_i to the next one between l and
l+1. For each l, just store either the outcome which covers all the l-th
unit interval or the two outcomes and the transition point.
It's not the most elegant solution and in case you have very small values
you may think of some variation, but in your case it should work quite well.
Best regards
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|
