搜索资源列表
约瑟夫环问题（数组法）
- 约瑟夫问题的求解方案，经典-Joseph solving the problem, classic
Joseph
- 数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.
txt
- 约瑟夫的链表实现-achieve Joseph objectlist
约瑟夫环问题
- 这是解决约瑟夫圜的程序. 注释:这是本人自己编写的.不足之处请各位大哥大姐多多指教,另外请注意版权问题.-Joseph won the procedures. Note : This is my own prepared. Deficiencies Department asked Big Brother Big Sister to the exhibitions, and to copyright issues.
循环链表实现Joseph
- 循环链表实现约瑟夫环，并对输入错误进行检查和提示。-cycle Chain achieve Josephus, and input error check and tips.
yuesefuhuan1
- 约瑟夫环的实现代码,大家有需要的可以开看看 -Joseph Central codes, we need to see it open
MyJosephus
- 刚刚自己做的约瑟夫算法，是用链表实现的，很简单的，检验没错误，当然，中间有些东西可以根据需要自己改动-just doing Joseph algorithm is used to achieve the linked list, a very simple test not wrong, of course, Middle some things may need to change their own
Yosefu
- 用环形链表解决的约瑟夫问题，其实不难，本人能力实在有限，做出这个已经差不多到极限了，请不要删除，谢谢！-Ring tree to Joseph, in fact, it is not difficult, I capacity is limited, This has been made almost to the limit, please do not delete, thank you!
Josephu
- 该程序能够解决约瑟夫问题，即n个人围成一圈，每m个人出局一人，求出出列的顺序，并且求出最后留下哪个人-procedures to solve the problem of Joseph, n individuals form a circle, every individual out of the game, a m, sought out the order out, and which was obtained last person
Fast_Joseph
- 时间复杂度为O(nlogn)的Joseph排列问题的计算程序。程序的运行时间与m无关。在一分钟之内可以计算n=10^6,m任意的Joseph排列问题.-time complexity of O (nlogn) Joseph problems with the program. Procedures for the running time has nothing to do with the m. In a minute can be calculated n = 10 ^ 6, m arbit
JosephProgram
- Joseph环的小程序. 欢迎批评指正-small procedures. Correction welcome criticism
yuecefuhuan
- 实验题目 约瑟夫环 一、 实验目的 用一个循环链表来实现约瑟夫环问题 二、 实验内容 编号为1，2，……，n的n个人按顺序时针方向围坐一圈，每个人吃一个密码。一开始任选一个整数作为报数上限值m，从第一个人开始顺时针自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从它在顺时针方向上的下一个人开始重新从1报数，如此下去直到所有人全部出列。 三、 需求分析 输入m=20；n=7，7个人的密码依次是：3，1，7，2，4，8，4，出列顺序为：6，1，
yuesefuhuan111
- 用c语言编写的一个约瑟夫患的程序！！！大家可以下载使用-c language used in the preparation of a procedure with Joseph! ! ! Members can download
ovtoolbox
- The Engineering Vibration Toolbox is a set of educational programs written in Octave by Joseph C. Slater. Also included are a number of help files, demonstration examples, and data files containing raw experimental data. The codes include si
jesoph
- 实现约瑟夫（Josephu）问题，n,m,k为外部输入，并打印输出结果-achieve Joseph (Josephu), n, m, k for external input, output and print
joseph（选做题)
- 课程设计--魔阵问题-curriculum design -- the devil RUF issue
Chapter1_2
- 本程序的说明的较著名的约瑟夫环问题-the procedure that the more famous Joseph Loop
shujijiegou
- 用数据结构做的约瑟夫问题，其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election
Joseph.txt
- 约瑟夫环的最简短的代码，用的是单链表循环，是用Ｃ语言编写的
joseph
- 约瑟夫环的源程序，希望大家能够支持我的多谢大家