Random Baseline (RND)

As a baseline for comparing algorithms, we use clustering labels drawn from a uniform random distribution over the integers from 1 to $k$. The complexity of this algorithm is $O(n)$.