搜索资源列表
Josephus
- 约瑟夫问题C++求解 以及KMP算法的C++实现-Joseph C++ problem solving as well as the KMP algorithm for C++ implementation
joze
- 用数组简单地模拟Josephus(约瑟夫)问题 ，算法简单明了，不像平常用链表实现的复杂-solve the Josephus problem
Josephus
- 编写一个求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人。然后使用n = 9, s = 1, m = 5，以及n = 9, s = 1, m = 0，或者n = 9, s = 1, m = 10作为输入数据，检查你的程序的正 确性和健壮性。最后分析所完成算法的时间复杂度。定义JosephusCircle类，其中含完成初始化、报数出圈成 员函数、输出显示等方法。-Josephus write a problem solving function. W
2
- 2． 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列-2. Josephus solution of the problem with the circulation list. With n individuals sitting around a round tab
josephus
- C语言实现的约瑟夫环问题，该问题的另一个名字叫做猴子选老大。-C language implementation of the Joseph cycle problem, the problem is another name is Hou Zi election boss.
2-5-3
- 使用顺序存储的线性表解决约瑟夫（Josephus）问题-Use the table to solve the linear sequence of storage, Joseph (Josephus) problem
Josephus_problem
- 自己编写的Josephus问题的求解方法，用C语言采用数组方式实现，个人认为比教科书上提供的方法要精简的多，和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to
Josephus
- 约瑟夫问题，这是用VC环境实现的一个数据结构经典问题-Joseph, and this is a VC environment data structure to achieve the classic problem
Jorseve
- 用于解决约瑟夫问题。堆栈方法。约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。 -Joseph used to solve the problem. Stack method. Josephus problem is a well-known problem: N individual circle, starting from the first report n
Josephus_shuzu
- Josephus问题的解决方法——用数组方法实现的程序源码-solution to the Josephus problem- an source code based on an array of methods used to achieve the program
Josephus_link
- Josephus问题的另一种解决方法 使用循环链表解决的源代码-Josephus problem using an alternative solution to solve the source code of circular linked list
Josephus
- 约瑟夫问题的循环链表求解，可以输出每一步的结果-Joseph circular linked list problem solving, can output the results of each step
ChooseKing
- 约瑟夫问题，也即猴子选大王的问题。采用循环链表来实现。-Josephus problem, namely the problem of the monkey king election. Achieved using circular linked list.
Josephus
- 是一个数学的应用问题： 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 -The application is a mathematical problem: given n individuals (in numbers 1,2,3 ... n, respectively) sitting around a round table a
E_Josephus
- 模拟Josephus问题，编写算法实现击鼓传花。-Analog Josephus problem, write algorithm drum transfer flowers.
Josephusproblem
- Josephus 问题的算法，在一船上有n人，需要救m人，n个人围成一圈，相隔k个人就丢掉一个，直到只剩下m个人-Josephus problem algorithm, there are n people in a boat, people need to save m, n people form a circle, separated by k individuals to lose one, until only the m individual
jp_problem
- a solution to josephus problem with a circular link list. a typical examle of circular link list.
2-2
- 求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人，并采用数组表示作为求解过程中使用的数据结构。-Josephus problem solving functions. With a sequence of integers 1, 2, 3, ... ..., n that order around a round table around and use that as an array of data used in the process of
shujujiegoua
- 数据结构里面基本所有的知识点的代码为全班同学的作业如约瑟夫问题、哈弗曼编码、层次二叉树、深度广度遍历-Data structure inside knowledge of the basic points of all the code for the whole class of operations such as Josephus problem, Ha Fuman coding, hierarchical binary tree, depth, breadth traversal
Josephuss-Problem
- This Josephus s Problem it is make a Visual C++ -This is Josephus s Problem it is make a Visual C++