搜索资源列表
yuesefuhuan
- 数据结构的一个实验报告,约瑟夫环,含完整代码-The data structure of an experimental report, Joseph ring, containing the complete code
Joseph-problem
- 约瑟夫环队的程序,其中包含四种不同的程序,包括带头结点,不带头结点的队列程序-Josephus team program, which includes four different programs, including to take the lead node does not take the lead in the queue of the node program
JosephSTL
- [转发]约瑟夫环问题的一种C语言的算法,STL链表解法。-[Forwarded] Josephus a C language algorithms, STL linked list solution.
Josehpos
- [转发]约瑟夫环问题的不带头结点的循环链表解法,可以成功运行哒~-[Forwarded] Josephus problem does not take the lead in the solution of the circular linked list of nodes, you can successfully run da ~
Josehpos
- [转发]约瑟夫环问题的带头节点的循环链表的解法-[Forwarded] the solution of the circular linked list of the leading node of the Josephus problem
Josephus
- [转发]约瑟夫环问题的数组解法,很简单的一个算法。-[Forwarding] the Josephus array solution, a very simple algorithm.
YueSeFuHuan
- 该代码实现了约瑟夫环,算法简单易懂,复杂度较低。-The code Josephus, the algorithm is straightforward, low complexity.
Josephus
- 线性表实现约瑟夫(Josephus)环问题 VC实现-Linear table to achieve Joseph (Josephus), Central problems VC in
Josephus
- 数据结构,简单的约瑟夫环的实现,VC++源代码,使用C/C++语言-Data structures, simple Josephus, VC++ the source code, using C/C++ language
Joseph
- 经典问题约瑟夫环,c循环解法,简单明了。-The classic problem Josephus, c cycle solution, straightforward
Jose
- 实现约瑟夫环的程序。采用C语言编译。是数据结构的题目。参考严蔚敏-Joseph ring to achieve the program. Using C language compiler. Is the subject of the data structure. Reference YAN Wei-min
josephus
- 分别以数组指针和模拟指针的方法解决约瑟夫问题-Respectively pointer array pointer and simulation methods to solve the problem of Joseph
huan
- 约瑟夫环问题的代码。设有N个人围坐一圈,从某个人开始报数,数到M的人出列,接着从出列的下一个人开始重新报数,数到M的人又出列,如此下去,直到所有人都出列为止.试设计确定他们的出列次序序列的程序。-Joseph cycle problem code. With N individuals sitting around a circle, starting from the one person reported the number of people who count the column M
jsf
- 说明:用单向循环链表解决约瑟夫问题,有源码,有分析注释-Descr iption: Josef problem solve with one-way circular linked list, source code, and Analysis Notes
ConsoleApplication1
- 数据结构思密达 约瑟夫环思密达 链表的基本实现思密达-The linked list data structure thinking the secret Dayuesefu ring Smecta basic Smecta
Josephus
- 应用模板类编写的约瑟夫环求解程序。涉及类、循环链表的使用。-A solution of Josephus ring,written by C++.Involving template class,Circle linklist.
Josephus
- 约瑟夫环问题:设编号为1,2,3,……,n的n(n>0)个人按顺时针方向围坐一圈,每个人持有一个正整数密码。开始时任选一个正整数做为报数上限m,从第一个人开始顺时针方向自1起顺序报数,报到m是停止报数,报m的人出列,将他的密码作为新的m值,从他的下一个人开始重新从1报数。如此下去,直到所有人全部出列为止。令n最大值取30。要求设计一个程序模拟此过程,求出出列编号序列-Josephus problem: Let numbered 1, 2, 3, ...... n n (n> 0) i
JOSEPHUS
- 约瑟夫环问题的实际场景。已知n个人围坐在圆桌周围,从编号k的人开始报数,数到m的那个人出列,依次下去,直至全部出列。采用的解决方法是典型的循环链表的数据结构。-Josephus actual scene. Given n people sitting around the round table, starting from the number k reported number, the number to m the man out of the line, and go on, unti
Josephus
- 实现约瑟夫问题的4种算法,并有计时功能进行效率测试-4 algorithms to resolve Josephus Problem with timing counter for testing efficiency
Joseph-problems
- 约瑟夫问题的一种描述为,编号为 1,2,3,……n 的n 个人按顺时针方向围坐一圈,每人持有一个密码(正整数)。一开始任选一个正整数作为报数上限值m,从第一个人开始按顺时针方向自1 开始顺序报数,报到m 时停止报数。报m 的人出列,将他的密码作为新的m 的值,从他在顺时针方向上的下一个人开始重新从1 报数,如此下去,直至所有的人全部出列为止。试设计一个程序求出出列顺序。-Joseph problems for a descr iption, number 1,2,3,......N n indi