不重复的随机数的产生（The generation of random numbers that are not repeated）.docVIP

下载本文档

3
0
约5.29千字
约 8页
2017-08-15 发布于河南
举报
版权申诉

不重复的随机数的产生（The generation of random numbers that are not repeated）.doc

1、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

不重复的随机数的产生（The generation of random numbers that are not repeated）

不重复的随机数的产生（The generation of random numbers that are not repeated） How do you generate random numbers that do not repeat? 2010-07-23 The usual way to generate random numbers is not to think about repetition, because even repetition is a normal thing in probability. But what about random data that does not need to be repeated in some cases? I think from the general direction, there should be only two ways. Sacrifice time or sacrifice space. The following are generated in the range of 101~200 (set to b[100], which is actually additional space) from which 10 non repeated random numbers (set to a[10]) are generated. Sacrifice time This method does not require additional space B arrays. To produce a random number that cannot be duplicated within a certain range, the random numbers that have been generated are saved as historical data. When a new random number is generated, the historical data is searched; if found, a new duplicate data search is re created; otherwise, it is assumed that a new, different random number has been found. Predictably, each new generated random number must be compared to all previous numbers. If repeat, abandon, produce again; otherwise, produce next. The average time consuming is n squared. It seems that the above program does not seem to have any problems, and the program can also be passed during the execution. But when we analyze carefully, we find out whether the new random number is already there. Since it is a random number, then from a mathematical point of view, it is possible to have a random number r at the same time in probability. Although this possibility is very small, it is a matter of logic and correctness. Therefore, the new random number r generated each time, may be one of the first I-1 numbers of the array random, that is to say, the program may cause a dead loop during the operation! One might argue that this probability is very small, almost zero. Yes, but I would like to ask what are the five main features of the algorit