Introduction - If you have any usage issues, please Google them yourself
The round-robin schedule: divide and conquer algorithm to generate a round-robin schedule (1-2 n-th individual) Input: an integer n output: (1-2 of the n-th individual of the round-robin schedule)