Wikipedia:Reference desk/Archives/Mathematics/2013 September 13
| Mathematics desk | ||
|---|---|---|
| < September 12 | << Aug | September | Oct >> | September 14 > |
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
September 13
[edit]random lookup
[edit]- Having an array of N distinct items and trying to find one by randomly probing K×N times (with no guarantee that all indices tested are distinct).
How big should K be?
This is an outline of the question asked by 195.56.96.233 at WP:RD/Computing#random_looku (in archive: Wikipedia:Reference desk/Archives/Computing/2013 September 13#random looku), please reply there. --CiaPan (talk) 19:45, 13 September 2013 (UTC)