关键词: 算法设计, 动态循环链表, 文本文件, Josephus问题

Abstract: Josephus problem is one of the headstreams of combinatorics. There are so many methods to descript the Josephus problem now. In this paper, after so many experiments and analysis, a common method is summarized and an algorithm is designed, which is based on circular linked list. The data source of the algorithm is from text file, so the practicability is enhanced. And since the circular linked list is created based on the ascendant sequence of the data list, so the data can be classified effectively to make the Josephus data list to be distributed symmetrically and no duplicate. Some applications of Josephus problem is offered, which include the test paper combination algorithm in common test questions database, and finding a list of data, which belongs to certain range, from a set of data, etc.

Key words: Josephus Problem, Algorithm Design, Dynamic Circular Linked List, Text File