Talk:Constrained random points on a circle: Difference between revisions
Content added Content deleted
m (→C code: done) |
m (→Not 100 points: added a couple of comments on point counting. -- ~~~~) |
||
Line 23: | Line 23: | ||
: You could have a good RNG and yet get exactly 100 points by simply checking for duplicates and continuing until you have 100 points (or alternatively, make a list of all points, random-shuffle it, and take the first 100 items from the resulting list). |
: You could have a good RNG and yet get exactly 100 points by simply checking for duplicates and continuing until you have 100 points (or alternatively, make a list of all points, random-shuffle it, and take the first 100 items from the resulting list). |
||
: BTW, the revised description isn't quite right: The points don't overlap; you get the ''same'' point several times. --[[User:Ce|Ce]] 16:31, 3 September 2010 (UTC) |
: BTW, the revised description isn't quite right: The points don't overlap; you get the ''same'' point several times. --[[User:Ce|Ce]] 16:31, 3 September 2010 (UTC) |
||
:: The Algol68 example has 257 points plotted, ... for the life of me, I couldn't find where it restricted the number of points to 100. |
|||
:: The PL/I example has only 39 points plotted, it's overly restricting the points (choosing a random point, and THEN see it the point is in the annulus). |
|||
Am I following the proper protocol for drawing attention to an example's deficiencies, or should I live by the motto: "people in glass houses shouldn't throw stones"? -- [[User:Gerard Schildberger|Gerard Schildberger]] 16:59, 23 April 2012 (UTC) |
|||
-- [[User:Gerard Schildberger|Gerard Schildberger]] |
|||
== How to check the code == |
== How to check the code == |