Roulette-wheel selection via stochastic acceptance

► We show that a roulette-wheel selection algorithm might be formulated as an algorithm of typically O(1) complexity. ► Previous implementations were of at least O(logN) complexity and were based on search methods. ► Our algorithm is based on a stochastic acceptance and is very simple, what allows for its further modifications.