Optimisation of Algorithms Generating Pseudorandom Integers with Binomial Distribution

Abstract

This article summarises the creation of two approaches how to produce pseudorandom integers with binomial distribution and their comparison with other selected implementations. The first approach does the work by preparing a probability table searchable by the binary search algorithm, and the second one is about generating the values using the Galton board simulation. The second approach is slower (significantly slower for bigger numbers of trials) but is applicable in situations where the probability of success (connected to the binomial distribution process) is not uniformly distributed.