搜索资源列表
jose
- 用C++语言实现的约瑟夫问题，主要采用链表结构，可以自己输入总人数以及存活的间隔。-Joseph problem with C++ language, the main use of the list structure, you can enter your own survival as well as the total number of intervals.
huan
- 约瑟夫环的程序，简单明了，面试经典题，对链表知识的拓展练习。-Joseph ring program, simple, classic interview questions, to list the development practice of knowledge.
Josephu
- 约瑟夫问题：编号为1,2，...n的n个人围坐一圈，约定编号为k的人从1开始报数，数到m的那个人出列，它的下一位又从1报数，数到m的那个人又出列，知道最后所有人都出列，由此产生一个出队编号的序列-Joseph problem: numbered 1,2, ... n individuals sitting around a circle of n, k who agreed numbered starting 1 reported that the number, the number to
Joseph
- java版的约瑟夫环实现，使用了内部类与循环链表-joshn in java with inner class
joephs-problem
- 本程序是中国科学技术大学数据结构的上机作业，本人亲自编写并调试通过，主要使用链表求解约瑟夫问题。-This program is on the machine operation University of Science and Technology of China data structures, personally written and debugged, the main use of the list Joseph problem solving.
john
- 约瑟夫环文题描述：已知n个人围坐圆桌周围。从编号k的人开始报数，数到m的那个人出列；他的下一个人有1开始报数，数到m的那个人呢出列，一次规律重复下去-Joseph ring title descr iption: n known individuals sitting around the table.People began to count off number k, count to m out the man He has 1 started to count off the next
Circulink
- C#利用循环双向链表解决约瑟夫环问题，算法简明可读性强，是学习数据结构的优秀材料。-Using C# to solve the problem of Joseph ring cycle of two-way linked list algorithm is concise, readable, is excellent learning materials data structure.
Newton
- 牛顿法最初由艾萨克·牛顿于1736年在 Method of Fluxions 中公开提出。而事实上方法此时已经由Joseph Raphson于1690年在Analysis Aequationum中提出，与牛顿法相关的章节《流数法》在更早的1671年已经完成了。-Newton' s method originally developed by Isaac Newton in 1736 in the Method of Fluxions openly. In fact this time ha
Joseph
- 设有ｎ个人依围成一圈，从第１个人开始报数， * 数到第ｍ个人出列，然后从出列的下一个人开始报数，数到第ｍ个人又出列，…， * 如此反复到所有的人全部出列为止。设ｎ个人的编号分别为1，2，…，n，打印出出列的顺序-Number,* the number of individuals out to the first m columns, and then start the next person reported that the number of columns, the number o
data-structure
- 在学习数据结构时完成的几个小的编程练习，大家可以参考参考，分别是中缀转后缀表达式，约瑟夫问题，一元多项式相乘-Upon completion of the study data structure of several small programming exercises, you can refer to the reference, which are in turn postfix infix expression, Joseph problems, one yuan polynomia
5_0
- 约瑟夫代码 可解决四则运算 这么麻烦你怎么不去死 不就下个代码嘛 -Joseph code can solve the four operation so much trouble you can not go to the next code thing
Desktop
- 使用线性表解决约瑟夫问题使用线性表解决约瑟夫问题-Use the linear table to solve the Joseph problemUse the linear table to solve the Joseph problem
josephProblem
- 解决约瑟夫问题一个程序实例，求解写成了一个函数-To solve the problem of Joseph example, a program written in a function
jose1
- 递推算法求解扩展约瑟夫环问题，C++源代码-Recursive algorithm for solving extended Joseph ring problem, C++ source code
JosephProblemTest
- 使用java语言编写的一个求解约瑟夫环的程序。- A program for solving the Joseph ring using java language
Joseph_Circle
- 约瑟夫问题如下：已知n个人(n>=1)围桌一园桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针 数到m的那个人出列。他的下一个人又从1开始报数，数到m的那个人又出列。依此规则重复下去，直到所有人 全部出列。求解最后一个出列的人的编号!-Joseph problem as follows: Given n people (n> = 1) sit around a park around the table, in order a start number. From
data-structure-code
- 数据结构里的二叉树、约瑟夫问题、链表、哈夫曼树问题的程序代码-Program code binary tree data structure, Joseph problems, linked lists, Huffman tree problem
008722
- 用MFC对话框实现约瑟夫环，生成随机数产生出列整数，简单实现-Implemented with MFC dialog box the Joseph link
Josephus-Problem
- 此代码为约塞夫环问题，为很重要的算法之一，是在Vc6.0环境下编译的，经过编译可以运行。-This code for Joseph Central issues, as one of the very important algorithm is compiled in VC6.0 environment, after the compiler can run
YESEPH
- 约瑟夫问题源代码，有多个版本，经过多次修改，这个是最简的。-Joseph problem source code