Description: Joseph algorithm: n individuals in a circle, each with a different number, choose a person as a starting point, and then clockwise to count from 1 to k, each count to exit the circle k, narrow circle, and then from the next person to continue to count from 1 to k, repeat the above process. And the man finally launched circle of the original number.
Idea: according to the above algorithm to exit the circle, until there is n- 1 personal circle, and then get the final out of the number people.
The serial number of procedures: sit in a circle of people do not need to be arranged in sequence
To Search:
File list (Check if you may need any files):
约瑟夫环问题求解算法.C
Download