From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c7fc42d2c6a0eedc X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-04-03 04:39:00 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.icl.net!newsfeed.fjserv.net!newsfeed.icl.net!newsfeed.fjserv.net!newsfeed.freenet.de!feed.news.nacamar.de!news.belwue.de!news.uni-stuttgart.de!not-for-mail From: Peter Hermann Newsgroups: comp.lang.ada Subject: Re: Ada2005 random Date: Thu, 3 Apr 2003 12:39:00 +0000 (UTC) Organization: Comp.Center (RUS), U of Stuttgart, FRG Message-ID: References: NNTP-Posting-Host: sinus.csv.ica.uni-stuttgart.de X-Trace: news.uni-stuttgart.de 1049373540 12166 129.69.118.70 (3 Apr 2003 12:39:00 GMT) X-Complaints-To: news@news.uni-stuttgart.de NNTP-Posting-Date: Thu, 3 Apr 2003 12:39:00 +0000 (UTC) User-Agent: tin/1.5.12-20020311 ("Toxicity") (UNIX) (Linux/2.4.20-xfs-preempt (i686)) Xref: archiver1.google.com comp.lang.ada:35905 Date: 2003-04-03T12:39:00+00:00 List-Id: David C. Hoos, Sr. wrote: > Such an approach is statistically dubious, since the same generator is > being used for all draws. Normally, one would use a distinct > generator for each sequence. agreed: this is of course not a purist's approach although I could live with it in the practice. Using Lutz Do's code (thank you) should do the job. Do you have a better idea how to pick out randomly from a set with an always changing number of members? -- --Peter Hermann(49)0711-685-3611 fax3758 ica2ph@csv.ica.uni-stuttgart.de --Pfaffenwaldring 27 Raum 114, D-70569 Stuttgart Uni Computeranwendungen --http://www.csv.ica.uni-stuttgart.de/homes/ph/ --Team Ada: "C'mon people let the world begin" (Paul McCartney)