c语言概率算法简介（Introduction to probabilistic algorithms for c languages）.docVIP

下载本文档

1
0
约8.86千字
约 12页
2017-09-05 发布于河南
举报
版权申诉

c语言概率算法简介（Introduction to probabilistic algorithms for c languages）.doc

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

c语言概率算法简介（Introduction to probabilistic algorithms for c languages）

c语言概率算法简介（Introduction to probabilistic algorithms for c languages） Probability algorithm Each calculation step of many algorithms are fixed, the probability algorithm and below we discuss the algorithm allows the selected at random during the execution of a calculation procedure. In many cases, when the algorithm has a choice in the implementation process, the random choice is often the optimal choice of time. Therefore the probability algorithm can reduce the complexity of the algorithm to a great extent. A basic feature of probability algorithm is the same example for solving the problem with the same probability algorithm two may be completely different results. The two problem of the time required and the results obtained may be quite different. In general, the probability algorithm is broadly divided into four categories: numerical probability algorithm, Monte Carlo (Monte Las Vegas (Las Carlo) algorithm, Vegas algorithm) and Sherwood (Sherwood) algorithm. The numerical algorithm used in numerical problems in probability. This kind of algorithm are often approximate solution. But the accuracy of the approximate solution with the increase of computing time increasing. In many cases, to calculate the exact solution of the problem is not possible or not necessary, it can be quite a satisfactory solution with numerical probability algorithm. Monte Carlo algorithm is used to solve the problem of accurate. For many problems, the approximate solution is meaningless. For example, a decision problem and its solution is yes or no, the two will be one, there is not any approximate solution. Again, we require an integer factor when given the answer must be accurate, approximation factor of an integer without any meaning. A solution by using the Monte Carlo algorithm can find the problem, but the solution is not necessarily correct. The probability of correct solutions used in the algorithm of time dependence. The more time used by the algorithm, get the higher probability