搜索资源列表
ysf
- 这个小程序是用c++实现的约瑟夫环问题，也属于数据结构中的经典算法-This applet is used c++ to achieve the Joseph Central problems in the data structure is a classic algorithm. . .
ysfh
- 约瑟夫环问题 很标准 输入很合理 数据结构课程设计内容-Joseph Central question is a very reasonable standard input data structure the content of the curriculum design
yusefuhuan
- 解决Josephus(约瑟夫环)问题的pascal代码-Solve the Josephus (Joseph Central) in pascal code
Josephus
- 约瑟夫环问题：n个人围成一个圈开始报数，报到m的人出列，求出列的次序，并动画显示。-Josephus
Joseph
- 约瑟夫环问题的源代码（数据结构）,方便用来学习编程。-Joseph Ring problem' s source code (data structure) to facilitate for learning programming.
josephus
- C语言实现的约瑟夫环问题，该问题的另一个名字叫做猴子选老大。-C language implementation of the Joseph cycle problem, the problem is another name is Hou Zi election boss.
03081148Josephus
- 约瑟夫环问题 n个小孩做成一圈 每个人有一个密码 有一个初始密码 顺时针转 转到者出列并把密码作为新的密码-Joseph Ring problem n kid everyone made a circle with a password to an initial password clockwise and the password are the column as a new password
Atwodimensionalarrayofsaddlepoints
- 约瑟夫环问题、冒泡发排序、寻找二维数组鞍点，这三个小程序的学习性较高！-Joseph loop problem, bubbling hair, looking for a 2d array of saddle points, the three little program of higher learning!
Josephus
- 约瑟夫环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个正整数。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的号码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。-Joseph Central Question: numbered 1,2,3, ..., n of n individuals sitting around a circle clockwise
1
- 双向循环链表解决约瑟夫环问题 -Two-way linked list to solve the problem, Joseph Wan, Central, two-way linked list to solve the problem, Joseph
Joseph
- 约瑟夫环问题的源代码，对你也许有用，希望能帮助你-Joseph loop problem
shujujiegouzonghesheji
- 数据结构中的综合大程序设计：背包问题的求解；约瑟夫环问题的求解；教学计划的编制；八皇后问题；农夫过河问题的求解-Complex data structures Programming: Knapsack Problem Joseph Central Problem teaching plans eight queens problem farmer across the river Problem
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
Josephus
- 简单的约瑟夫环和复杂的约瑟夫环问题的代码。-Simple Joseph ring and complex Joseph ring problem code
JoseQuestion
- 约瑟夫环问题求解 约瑟夫环问题的具体描述是：设有编号为1，2，……，n的n(n>0)个人围成一个圈，从第1个人开始报数，报到m时停止报数，报m的人出圈，再从他的下一个人起重新报数，报到m时停止报数，报m的出圈，……，如此下去，直到所有人全部出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。-Josephus Josephus problem solving specific descr iption is: has numbered 1, 2, ...... n n (n
yueshefu
- 一个介绍 约瑟夫环 问题的 一个算法。采用了 链表结构-An introduction Josephus an algorithm. Using a linked list structure
Josephus
- 约瑟夫环问题，用户输入M,N值，从1至N开始顺序循环数数，每数到M输出该数值，直至全部输出。-Josephus, the user input M, N values, each number to the start sequence and cycle count from 1 to N, M output the values, until all the output.
the-problem-of-Joseph-ring
- 关键词：数据结构，算法，约瑟夫环问题的算法。-the problem of Joseph ring.
ex1
- 单环链表实现约瑟夫环问题，用了链表的应用，可以输入n，m，s-The single ring linked list implementation Josephus, with the application of a linked list, you can enter n, m, s