A Python simulation to Coupon Collector's Problem

CouponCollectors.py

# simulate coupon collector's problem

import numpy as np


def run(n):
    """
    n: number of different coupons (stamps)
    return: days it took to achieve such goal
    """
    days = 0
    collected = set()
    while True:
        # check if we have enough
        if len(collected) == n:
            break
        # we try to collect stamps
        got = np.random.randint(0, n)  # choose a stamp, randomly 1/n
        days += 1
        collected.add(got)

    return days


if __name__ == '__main__':
    totaldays = 0

    for x in range(1, 1000):
        totaldays += run(100)

    print(totaldays / 1000.0)