... larger.^6.1

Using a Sun Ultra2 2300, 300 MHz processor, running SunOS 5.5.1, one run of 10⁵ cells takes 8 seconds and 3.7MB RAM. The complexity of the algorithm is O($N \log(N)$), as it amounts to constructing the priority queue of cell objects. However, we have to do of the order N runs to obtain the distribution, thus the complexity of the algorithm for constructing the distribution is at least O( $N^2 \log(N)$).

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.