admin管理员组

文章数量:1130349

Consider the following algorithm:

while True:
     i = random(1, n)
     if a[i] == 1:
         return i

The objective is to find a position in an array

Consider the following algorithm:

while True:
     i = random(1, n)
     if a[i] == 1:
         return i

The objective is to find a position in an array

本文标签：

版权声明：本文标题：probability - How to Analyze the Best, Average, and Worst-Case Performance of a Randomized Algorithm for Finding a Value in an A 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://it.en369.cn/questions/1738210964a1554610.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。