Full Cycle - Example 1 (in C++)

Example 1 (in C++)

Given a random number seed that is greater or equal to zero. Given a total sample size greater than 1. Given a prime number that cannot be evenly divided into the total sample size.

A full cycle can be generated with the following logic. Each number in the sample_size should occur once.

unsigned int random_seed = 0; unsigned int sample_size = 3000; unsigned int generated_number = random_seed % sample_size; unsigned int prime_number = 7; unsigned int increment = prime_number; for(unsigned int iterator = 0; iterator < sample_size; ++iterator) { generated_number = (generated_number + increment) % sample_size; }