Description: Joseph (Josephus,) Central problem set of n individuals sitting around a round table around, from the s personal number off, count to the m-th individual, let him out then start again from out the next person reported that the number, the number to m individuals, to let him out, and so forth until all the people all out so far. The following to solve Joseph (Josephus,) ring question is: for any given n, s and m, find out the sequence of the n individuals. Requirements as a single cycle linked list storage structure, the Josephus problem. And then use the n = 9, s = 1, m = 5 and n = 9, s = 1, m = 10 as input data to check the correctness and robustness of your program.
To Search:
File list (Check if you may need any files):
Josephus.doc
Download