数据结构之经典算法----约瑟夫算法



问题导入：

“我不入地狱谁入地狱”问题：15个和尚和15个商人在沙漠遇难，必须让一半数量的人死掉，剩余的水和粮食才能勉强维持其余的人生存，并走出沙漠。当时定一个规则，30人围成一圈，从第一个人开始报数，每当数到9时，这个人自杀；然后继续报数，知道剩下15人为止。和尚们想“我不下地狱谁下地狱”，于是都决定自己现身。编写程序，为和尚们找到位置，保证他们献身，从而保全15名商人生存

----- Joseph algorithm for the problem to import the data structure of the classical algorithm: " I do not go to hell to hell"　issue: 15 monks and 15 businessmen were killed in the desert, half the number of people die, the remaining water and food in order to eke out the rest of the people to survive, and out of the desert. Given a rule, 30 form a circle and number off from the first person, whenever the count to 9:00, committed suicide　and then continue to report the number to know the remaining 15 people so far. The monks want to " I do not go to hell who go to hell" , so to determine their own appearance. Write a program to find a place for monks to ensure that their devotion to helping to save the 15 businessmen to survive