搜索资源列表
约瑟夫环问题link
- 学生初学,c实现约瑟夫环(圆桌问题),算法应该不是很高效,望各位高人看了改进改进!-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!
yuesefuhuan
- 这是一个约瑟夫环的问题-This is a question of Joseph Central
yuesefuhuan2
- 这也是一个约瑟夫环的问题-This is also a question of Joseph Central
yuesefu
- 本程序采用循环单链表的算法来解决约瑟夫环问题:建立一个循环单链表,按顺序查找指定结点,找到后删除,最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve the Joseph link problem: Establishes to circulate Shan Lianbiao, assigns the point accordin
jone
- 设有n个人围做一圈,现从某个人开始报数,数到m的人出列,接着从出列的下一个人开始重新报数,数到m的人又出列,如此下去,直到所有人都出列为止。运用循环单链表解决约瑟夫环问题。- Is equipped with n personally to encircle makes, presently starts from some person to count off, leaves ranks the number to the m
Joseph
- 数据结构中经典的约瑟夫环问题的解法。-data structure classic Josephus the solution.
约瑟夫环问题
- 这是解决约瑟夫圜的程序. 注释:这是本人自己编写的.不足之处请各位大哥大姐多多指教,另外请注意版权问题.-Joseph won the procedures. Note : This is my own prepared. Deficiencies Department asked Big Brother Big Sister to the exhibitions, and to copyright issues.
Chapter1_2
- 本程序的说明的较著名的约瑟夫环问题-the procedure that the more famous Joseph Loop
ysfh
- 这是数据结构中约瑟夫环问题!-This is the data structure Josephus problem!
约瑟夫环问题link
- 学生初学,c实现约瑟夫环(圆桌问题),算法应该不是很高效,望各位高人看了改进改进!-beginner students, c achieve Joseph Central (round table), the algorithm should not be very efficient, a person looking to improve reading improvement!
啊容
- 基于C++的数据结构,用单链表实现约瑟夫环问题,单链表的实现-C-based data structure, to achieve single-Chain Josephus, the realization of single-linked list
李森数据结构作业
- 文件夹中包括常用的数据结构的算法,包括二叉树的三种递归和非递归算法,染色问题,八皇后问题,深度广度遍历,约瑟夫环,数值转换,树的高度和叶子节点数,最小生成树 ,两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non- recursive algorithm, Dye
yosf
- 约瑟夫环的问题 包括指定人数.指定间隔. 呵呵.-Joseph Central issues include specified number. The designated intervals. Ha ha.
Yueshefu
- 一个汇编语言编写的程序,用来实现约瑟夫环,编写此程序时的具体问题是猴子选大王-an assembly language prepared by the procedures used to achieve Joseph Central, this program will prepare specific issues in the election monkey king
456456413786
- 数据结构课程设计打包下载,包括两个1.约瑟夫环 2.最小生成树问题!!!我已经交给老师,发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your referen
JOPHLINK
- 数据结构中约瑟夫环问题的链式存储结构(循环链表)算法实现-data structure Josephus the chain storage structure (circular linked list) Algorithm
05055413
- 这是一个用C++语言编写的约瑟夫环问题,旁附说明,已在测试环境下成功通过-This is a C language of Josephus, adjacent to report stated that the testing environment has been successfully adopted
myJoseph
- 我的数据结构作业<约瑟夫环问题求解>,可读性很好并附有文档.cjhacker-my data structure operation
shiy2
- 约瑟夫环问题的描述是:编号为1,2,┅,n的n个人按顺时针方向围坐一圈。任选一个正整数作为报数上限m,从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止。-Joseph Central, a descr iption of the problem is: No. 1,2, ┅, n of n individuals according
yuecefuhuan
- 实验题目 约瑟夫环 一、 实验目的 用一个循环链表来实现约瑟夫环问题 二、 实验内容 编号为1,2,……,n的n个人按顺序时针方向围坐一圈,每个人吃一个密码。一开始任选一个整数作为报数上限值m,从第一个人开始顺时针自1开始顺序报数,报到m时停止报数。报m的人出列,将他的密码作为新的m值,从它在顺时针方向上的下一个人开始重新从1报数,如此下去直到所有人全部出列。 三、 需求分析 输入m=20;n=7,7个人的