Introduction - If you have any usage issues, please Google them yourself
Data structure curriculum design, to achieve the following questions: Joseph (Josephus) Central question: numbered 1,2,3, ..., n, n individuals in a clockwise direction around a circle, each holding a password (positive integer). An optional start a positive integer as the upper limit of the number of reported m, started from the first clockwise order starting from a number of newspaper, report m stop. Reported m people out of the line, his password as the new value of m, in a clockwise direction from his people began again the next number from a newspaper, and so on, until all the series so far. N round robin to establish a personal list storage structure, after the end of the run, the output followed a team of people' s serial number.