搜索资源列表
Prime
- Prime算法生成最小生成树，使用GDI+将最小生成树画出-Prime algorithm to generate minimum spanning tree, minimum spanning tree to use GDI+ to draw
Find-the-prime-numbers-from-1-to-n
- 求1到n的素数，其中可能又不是很精简的地方，但程序还算快-Find the prime numbers from 1 to n, which may place and not very concise, but fairly quick process
Find-the-largest-prime
- Find the largest prime factor of a composite number
prime
- 这个程序给出4到100000000中所有的偶数都是可以由两个质数的和。-This program will solute a problem every even number can be a sum of two prime numbers.
VegaPrime
- Vega Prime中文教程，游戏引擎开发，更好更快-Vega Prime Chinese tutorial game engine development, better and faster ... ...
judge-prime-number
- 利用labview中的公式节点，实现判断素数的功能。-Labview using the formula node to achieve the function to determine the prime numbers.
HNU-12043-Prime-NumberAgain
- HNU 12043 的源代码。 核心代码为快速筛选素数-HNU 12043 source code. Rapid screening of the core code for the prime number
Prime
- prime算法实现，求图的最短路径，算法课的作业-prime algorithm, find the map of the shortest path algorithm homework assignment
prime
- 图论的最小生成树问题——Prime算法的C语言实现-Graph theory, minimum spanning tree problem- Prime algorithm in C language
prime
- PRIME NUMBER PROGRAM GENERATION
prime-factor
- 读入一个整数，显示它的所有的素数因子。例如，读入120，输出2,2,2,3,5-Read an integer, it shows all the prime factors. For example, read 120, the output 2,2,2,3,5
prime
- Prime算法求解最小生成树的java呈现-prime mst
Vega-Prime-Handout
- Vega的中文版应用手册。有详细的例程，适合入门者学习-The Chinese version of the Vega application manual. Detailed routines for beginners to learn
prime
- Displays prime numbers
Large-prime
- 在密码学中，大素数分解是一个难题，同样大素数的生成在素性检测中也是一个难点，本文主要围绕这个中心点展开-In cryptography, a large prime number decomposition is a problem, as the generation of large prime numbers primality testing is also in a difficult, this paper started
find-prime-numbers-code
- 此代码可以高效的求出所1到1200000的素数，具体的范围可以根据需要修改代码-This code can efficiently find the prime numbers 1-1200000, the specific scope may need to modify code
Prime
- JAVA多线程找质数。 输入为你想要创建的线程数和质数上限。 例： java PrimeSieve 10 3会利用三个线程输出10以下所有的质数-JAVA multi-threading to find prime numbers. Enter the number of threads you want to create the maximum number and quality. Example: java Pr
prime
- 输入一个数，判断这个数是否为素数的C语言代码- Enter a number to determine if the number is prime in C language code
PRIME-TEST
- 素数测试问题, 如果把乘、除法（包括取模）看成常数时间， 则算法的时间复杂度为 (k)= (log m)=O(log n)。 而当n极大时，与n在同一数量级的两个数相乘除， 不超过O(log2n)次二进制位操作。 ∴算法的时间复杂性为O(log3n)二进制位操作 -Prime test, If the multiplication, division ( includ
Prime
- This a Program that computes nth Prime number-This is a Program that computes nth Prime number