搜索资源列表
Joseph
- 约瑟夫问题，用循环队列解决，从指定的第m个元素到第n个元素依次读出队列中的元素-Joseph problems, and use circular queue resolved, the first m from the specified element to the first n elements in turn to read out the elements of the queue
Joseph
- 约瑟夫环源代码，Ｃ语言数据结构上机实习作业，保证正确哦！-Joseph Central source code, C language data structure on the machine operation training, and ensure the correct Oh!
Joseph
- 数据结构链表实验的joseph算法。可以实现数据结构练习册上的实验-the Descr iption of Joseph
Joseph
- 对约瑟夫问题的求解，适用于初学者熟悉数组函数-Solving the problem of Joseph, for beginners familiar with the array function
Joseph
- 这是数据结构中关于链表一部分的经典题目--约瑟夫-This is a linked list data structure on the part of the classical topics- Joseph
Joseph
- 约瑟夫问题，n个人围一个圈，输入m，每次第m个人被淘汰，留下的为胜利者-Joseph problems, n individuals are gathered in circles, type m, each time the first m individuals have been eliminated, leaving for the winner
Joseph
- 文件是一个对约瑟夫环的实现，运用了链表的数据结构对节点进行操作-the project is about the cometrue of Joseph huan using link to operate
Joseph
- 双向约瑟夫问题，利用双向链表实现双向进行的约瑟夫问题-Two-way Joseph problems, using two-way two-way linked to the issue of Joseph
joseph
- 严蔚敏版本数据结构题集约瑟夫环问题的源代码-Yan Wei-min version of the title sets the data structure the source code of the problem, Joseph Ring
Joseph
- 利用单向循环链表解决约瑟夫环问题,按出列的顺序印出各人的编号。-The use of one-way circular linked list to solve the problem, Joseph Wan, according to the order of a column printed in each number.
Joseph
- 数据结构实验：用链表模拟约瑟夫环问题C语言 Joseph-Experimental data structure: the problem with the linked list C-ring analog Joseph Joseph
Joseph
- C++源码_约瑟夫环问题(做了个简单的版本,可供学习参考)。-C++ source code _ Joseph Central issues (do a simple version, available for study and reference).
Joseph
- 约瑟夫环 约瑟夫问题的一种描述是：编号为1，2，3……的n个人按顺时针方向围坐成一圈，每人持有一个密码。一开始任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自1开始报数，报到m停止报数。报m的人出列，将他的密码作为新的m值，从他顺时针方向的下一个人开始重新从1开始报数，如此下去，直到所有人全部出列。-Joseph Ring Joseph, a descr iption of the problem is: numbered 1,2,3 ... ... n-individual
Joseph
- 约瑟夫问题，四种解法，分别是静态链表，顺序表两种和循环链表-Joseph problems, the four solution, namely a static list, order form and the cycle of two lists
Joseph
- 用C++语言实现的约瑟夫环。代码简洁，通俗易懂-C++ language with Joseph Central. Code simple and easy to understand
joseph
- 约瑟夫环（Joseph）问题的一种描述是：编号1，2，┉，n的n个人按顺时针方向围坐一圈，每个人持有一个密码（正整数），一开始，任选一个正整数作为报数上线值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1开始报数，如此下去，直至所有人全部出列为止。设计一个程序求出出列顺序。-Joseph Ring (Joseph) a descr iption of the problem is: No. 1,2,
Joseph
- 提供用户从键盘输入和Joseph约瑟夫环的必要数据，并显示出列顺序。-Provide the user from the keyboard input and Joseph Joseph ring the necessary data, and shows the column order.
joseph
- 大学本科数据结构课程实验。约瑟夫环C语言实现，内有清晰注释-Experimental data structure of undergraduate courses. Joseph Central C language, there are clear comments
joseph
- 这是个约瑟夫环课程设计，当报数到哪位时就出列，然后以出列的人的密码为下次报数值-This is Joseph Central curriculum design, as reported when the number to which a column, then the column' s password value for the next report
Joseph
- 有关著名的约瑟夫问题，用了三种方法，链表，公式化描述和虚拟指针-Joseph, the well-known problem, with the three methods, lists, descr iptions and virtual pointer formulaic