搜索资源列表
Josephus.java
- Josephus.java，是java课程的实验2 求解约瑟夫环问题-Josephus.java, is a java course experiment 2 Joseph Cycle Problem Solving
javalab
- java实验答案。其中包括：金额的中文大写方式 ，约瑟夫环问题，设计银行账户类及存取款操作方法，字符串练习与面向对象技术，设计学生成绩表，计算器，利用线程比较插入冒泡排序算法的好坏，使用多种方式读取文本文件。以及最后的 java中必懂的内容简介。-java experimental answer. These include: the amount of the way the Chinese capital, Joseph Central issues, the design of bank
Josephus
- 解约瑟夫环问题，最基础的一种数据结构算法。-Solution Joseph Central issues the most basic algorithm for a data structure.
Josephus
- 约瑟夫问题 一个值得java初学者寻味的问题-Joseph problems a problem worthy of java beginners ruminate
joseph
- 约瑟夫环的一个程序实例，通过循环单链表实现-Josephus, a process instance, by circulating a single linked list
Kruskal
- Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in
Joseph
- 解约瑟夫环的问题 约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Joseph ring problem Joseph ring is the application of a mathematical problem: n known individual (numbered 1, 2, 3... n
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
JosephProblemTest
- 使用java语言编写的一个求解约瑟夫环的程序。- A program for solving the Joseph ring using java language
Java
- 约瑟夫环的实现，打印一个字符串，十进制转换成二进制-The implementation of the Joseph Ring, prints a string that converts the decimal into binary