> Eg. for randomised algorithms you need a fast source of randomness. Though normal random() implementations are LCGs which have poor distributions when you ei

> Eg. for randomised algorithms you need a fast source of randomness. Though normal random() implementations are LCGs which have poor distributions when you either only look at the least significant bits or project them into multiple dimensions. As a result they may make some randomized algorithms perform poorly!