Algorithms, Sampling.
if we can only keep the bare minimum, i.e. O(k). Algo sketch Let’s continue with our example from the previous part, namely sampling from a continuous stream of integers starting at 0. The idea of a random sample of size 5 only makes sense when we have at least 5 elements. So when n=k=5 the answer