I have a situation where I have N items in the population (e.g. these are item IDs in some inventory). Suppose I can sample and get back 1 item at a time, where each item has an independent and uniform distribution of being sampled; for example, I would call some function sample()
and it would return one of the N items with probability $\frac{1}{N}$.
On average, how many samples would I need to observe all N items at least once? In other words, how many samples would I need to get the entire population? Obviously, I would need at least N samples as a lower bound, but is there a tighter bound?
Thank you for any help. I'm a software engineer, so please be gentle with any math.
O(N log N)
, but the linked question "Using Recursion to Solve Coupon Collector" does not mention that form. Why is that? – stackoverflowuser2010 Oct 07 '16 at 18:21