搜索资源列表
Josephus
- 使用C#编写的约瑟夫环的程序,配合严蔚敏版的《数据结构》中的实习1.2,有界面,运行于.Net 4.0的环境下。-The Josephus program written in C# with Yan Wei-min version of the data structure in the internship 1.2 interface running on Net 4.0 environment.
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
josephus
- 算法与数据结构——josephus 算法与数据结构实现josephus算法-Algorithms and Data Structures- josephus Algorithms and Data Structures josephus algorithm
the-Josephus-problem
- 利用建立双向循环链表来解决约瑟夫环的问题-Doubly linked list to solve the Josephus problem
Josephus
- 用C#编的Josephus(约瑟夫斯)问题的源码-the Josephus problem in C#
Josephus
- 约瑟夫环的实现,本程序可以正确运行,并且能够实现其功能-Josephus realization of the program can be run correctly, and is able to achieve its
Josephus
- 对约瑟夫问题的模拟,对约瑟夫环进行演示,可自行设定参数,也可使用默认参数,图形界面-about Josephus problems
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.
Josephus
- 约瑟夫环,数据结构里典型的编程题,有具体的c语言实现-Josephus, data structures typical programming questions, specific c language
Josephus
- 约瑟夫环实验报告,每个人密码相同的和不同的,顺序表和链表的-Josephus lab reports, everyone the same password and different .sequence table and linked list
Josephus
- 约瑟夫环 程序可直接运行 已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。-Josephus program can be run directly known n individuals (No. 1, 2, 3, ... n, respectively) were sitting around a round table. K repor
Josephus
- 用C++实现约瑟夫环,由用户动态输入密码。有实验报告。-With C++ achieve Josephus, by the users enter a password. Experimental report.
The-circular-list-Josephus-problem
- 循环链表josephus问题。设有n个人围圈,现从第s个人开始报数,数到第m个人出列,然后从出列的下一个人从新开始报数,数到第m个人又出列,如此反复,直到所有人出列-Circular list josephus problem. Suppose there are n individuals in a circle, is from the first s individual reported the number of individuals out to the m-number colu
Josephus
- 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。-Josephus is a mathematical application problems: Given n individuals (with numbers 1,2,3 ... n, respectively) were sitting at a roun
Josephus-
- 约瑟夫问题是个有名的问题:N个人围成一圈,从第一个开始报数,第M个将被杀掉,最后剩下一个,其余人都将被杀掉。例如N=6,M=5,被杀掉的人的序号为5,4,6,2,3。最后剩下1号。 假定在圈子里前K个为好人,后K个为坏人,你的任务是确定这样的最少M,使得所有的坏人在第一个好人之前被杀掉。-Josephus problem is a well-known problem: N personal circle, starting from the first report the number
josephus
- 用循环链求解约瑟夫问题,gnu gcc compiler in codeblocks-use circle link list to solve the problem of Josephus
Josephus-
- 约瑟夫环,经典的数据结构问题,适合初学者研究,用C#语言-Josephus, the classic problem of data structures, suitable for beginners, using C# language