Wikipedia:Reference desk/Archives/Mathematics/2013 September 13

= September 13 =

random lookup

 * 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 (in archive: Reference desk/Archives/Computing/2013 September 13), please reply there. --CiaPan (talk) 19:45, 13 September 2013 (UTC)