搜索资源列表
shujujiegouzonghesheji
- 数据结构中的综合大程序设计:背包问题的求解;约瑟夫环问题的求解;教学计划的编制;八皇后问题;农夫过河问题的求解-Complex data structures Programming: Knapsack Problem Joseph Central Problem teaching plans eight queens problem farmer across the river Problem
YueSeFuHuan
- JAVA 数据结构和算法 约瑟夫环问题 经典!-yuesefuhuan
yuesefuhuan
- 第一类约瑟夫环问题的c语言解决方案,程序简单易懂,适合初学者-The first issue of the c ring Joseph language solutions, the program is simple to understand for beginners
Joseph
- 解决长期以来我们难以解决的约瑟夫环问题 实现了自由输入人数及出队序号-We solve the long-standing problem difficult to solve to achieve the freedom of Joseph Ring and the team enter the serial number
Joseph
- 解决约瑟夫环问题,是个简单的小程序 作为初学者必须掌握的方法-Solve the problem of Joseph Ring
yuesefuhuan
- 约瑟夫环问题,也称为“杀人游戏”,依据给定的数值,按照既定的顺序列出数据-Joseph cycle problem, also known as " killing game" , according to the given value, the data listed in the order in accordance with established
JosephL
- 约瑟夫环问题是利用单向链表存储结构模拟的-Joseph Central issue is the use of one-way linked list storage structure simulation
yueSeFuHuan
- 约瑟夫环问题 C++ 数据结构 约瑟夫环问题 C++ 数据结构-Joseph Central C++ data structure problem
JOSEPHUS
- 这是数据结构中的一个问题,用一带头结点的单向链表解决“约瑟夫环”问题。-This is a problem about data structure , using a linked list without the lead node solution " Joseph Ring" problem.
yuesefu
- 约瑟夫环问题的解决 很简单的实现-Joseph Ring problems
shujujiegou
- 这里有数据结构课程设计的所有题目,有一些题目的参考实验报告,如停车场问题,八皇后问题,约瑟夫环问题-Here are all the data structures course design topics, some topics of the experiment report, such as parking problems, the eight queens problem, Josephus problem
JOSEPHUS
- 一个关于约瑟夫环问题的经典算法编程的C语言实现-the program about JOSEPHUS
Joseph-ring-on-vs-2011
- C++链表解决约瑟夫环问题,问题描述:假设有N个小孩按照序号1,2,,,N围坐成一圈,从第一个小孩开始报数,每次报到n的人退出,接着从下一个人重新开始从1开始报数,下一次再报到n的人退出, 求最后一个留下第几个人;-C++ linked list to solve the problem Josephus, described the problem: Suppose there are N children according to number 1,2,,, N sitting in a
efficient-monkey-king
- 猴子选大王 算法实现,即约瑟夫环问题,并不是模拟算法,而是将其转化为数学问题,从而提高算法性能-Joseph circle
0
- 约瑟夫环问题,在C语言开发案例中有介绍 个人有相对简便的方法。-Josephus problem, in the C language development are described in individual cases have a relatively easy way.
yuesefu
- 用c语言开发的来实现约瑟夫环问题的求解程序。-C language development to achieve the Josephus problem solver.
CPPdata-structure-of-Joseph-ring
- 首先,设计实现约瑟夫环问题的存储结构。由于约瑟夫环本身具有循环性质,考虑采用循环链表,为了统一对表中任意节点的操作,循环链表不带头结点-Design and implementation of Joseph ring problem
resourse
- 打开pdf 二叉树的建立与操作 银行家算法 约瑟夫环问题的编程-i don‘t know how to translate it in english ,sorry !!
Joseph
- 经典的约瑟夫环问题:编号为1,2,..., n 的n 个人按顺时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值 m, 从第一个人开始按顺时针方向自1 开始顺序报数,报到 m 时停止报数。报 m 的人出列,将它的密码作为新的 m值。试设计一个程序求出出列顺序。 现已C语言实现-Classic Joseph ring problem: Numbers for 1, 2,... , n n personal clockwise sat a lap, each hold
Josephus
- 解决约瑟夫环问题可实现人际交流,完整的错误处理,完成作业必备。-Man-machine communication Josephus problem