| 约瑟夫环次序解的链表模算法 |
| |
| 引用本文： | 白宇. 约瑟夫环次序解的链表模算法[J]. 雁北师范学院学报, 2013, 0(1): 13-15 |
| |
| 作者姓名： | 白宇 |
| |
| 作者单位： | 山西大同大学数学与计算机科学学院,山西大同037009 |
| |
| 摘 要： | 对经典问题“约瑟夫环”进行分析，提出了一种全新的基于链表模运算的高速算法，给出了在条件遍历算法设计中运用模运算的一般思路，同时进行了算法分析和实验测试。
|
| 关 键 词： | 约瑟夫环 链表计数 模运算 |
The Algorithm based on the Linked List Module Operation for Josephus Circle Order Solution |
| |
| BAI Yu. The Algorithm based on the Linked List Module Operation for Josephus Circle Order Solution[J]. Journal of Yanbei Teachers College, 2013, 0(1): 13-15 |
| |
| Authors: | BAI Yu |
| |
| Affiliation: | BAI Yu (School of Mathematics ＆ Computer Science, Shanxi Datong University, Datong Shanxi, 037009) |
| |
| Abstract: | To analyze the classic problem of ＂Josephus circle＂, we designed a new high-speed algorithm based on the linked list module operation, giving the general idea for the module operation in algorithm of conditions traversal, and completed the algorithm analysis and experimental testing. |
| |
| Keywords: | Josephus circle linked list to count module operation |
| 本文献已被 维普 等数据库收录！ |
