A fast alternative to the modulo reduction
Suppose you want to pick an integer at random in a set of N elements. Your computer has functions to generate random 32-bit integers, how do you transform such numbers into indexes no larger than N? Suppose you have a hash table with a capacity N. Again, you need to transform your hash values (typically 32-bit … Continue reading A fast alternative to the modulo reduction
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed