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.

Josephus.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．