Location:
Search - Eratosthenes
Search list
Description: A c/c++ program using threads to find prime no using sieve of eratosthenes.
Platform: |
Size: 1024 |
Author: Vishal j |
Hits:
Description: This is a program for parallel seive of eratosthenes.
Platform: |
Size: 1024 |
Author: Jerry |
Hits:
Description: 例：用筛选法求2～100之间的所有素数。
解：我们用下面的方法来解这题：先建立一个含有2～100之间所有自然数的数表，在数表中删去2的倍数(不包括2)；然后找2后面第一个被保留的数p(是3)，再删除p的倍数(不包括p)；然后再找下一个被保留的数(是5)，继续上述步骤：这样继续下去，直至P大于100为止。这样数表中剩下的数就是所要求的所有素数。这个求素数的方法称为爱拉托散(Eratosthenes)法。
-Example: Method 2 with the screening of all prime numbers between 100. Solution: We use the following method to solve this problem: first the establishment of a containing between 2 to 100 the number of all natural numbers table, delete table 2 in the number of multiples (not including 2) and then find the back of the first to be reserved 2 number p (a 3), then delete multiple of p (excluding p) and then find the next number to be reserved (was 5), continue the steps: continue to do so until the P is greater than 100 so far. So that the remaining number of tables is required for all prime numbers. This request is called Ai Latuo prime numbers scattered (Eratosthenes) method.
Platform: |
Size: 1024 |
Author: 00 |
Hits:
Description: Sieve of eratosthenes used to calculate prime numbers. (a java program) that runs in the command line.
Platform: |
Size: 2048 |
Author: graylien |
Hits:
Description: 河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
对C语言的学习非常有用。-Tower of Hanoi
Fibonacci row
Pascal triangle
Three-color chess
Mice have gone astray Officer (a)
Mice have gone astray Officer (2)
Knights go board
Eight Queen
Eight of silver
Game of Life
String to check
Color, tri-color Towers of Hanoi
Knapsack problem (Knapsack Problem)
The number of operator
Monte Carlo method for PI
Eratosthenes screening and quality
Long integer arithmetic (large numbers operation)
Long PI
The greatest common divisor, least common multiple, factoring
Perfect number
Armstrong number
The maximum number of visitors
Sequence type (pre-order type) in sequence rotary
After the order type of computing
On gambling
Wash cards (random number order)
Craps gambling game
The problem of Joseph (Josephus Problem)
Collection of problems
Permutations and combinations
Gray code (Gray Code)
Produce may be the collection of
m elements of a collection of n elements in a subset of
Digital dismantling
Sort
Score Ranking
Select, insert, bubble sort
S
Platform: |
Size: 64512 |
Author: 李艳文 |
Hits:
Description: Calculates prime numbers with use of the "Sieve of Eratosthenes".
Platform: |
Size: 5120 |
Author: Rocky |
Hits:
Description: 除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的
求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质
数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast
Find prime numbers are always programmers and mathematicians efforts topics here introduce a famous Eratosthenes seeking quality
Number of methods.
Platform: |
Size: 1024 |
Author: tiercel |
Hits:
Description: 要求质数很简单，但如何快速的求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的 Eratosthenes求质数方法。-Requirements primes is very simple, but how fast it has been determined primes programmers and mathematicians efforts topics here introduce a famous Eratosthenes seeking prime method
Platform: |
Size: 11264 |
Author: 王硕 |
Hits:
Description: 包含了大学计算机的数据结构算法，Eratosthenes筛选法素数、huffman编码、多种查找、二叉树创建与遍历、多种排序、图的建立和遍历等。
-Contains the data structure algorithms university computers, Eratosthenes screening primes, huffman coding, multiple search, binary tree traversal create a variety of sorting, graph creation and traversal.
Platform: |
Size: 1907712 |
Author: yzt |
Hits:
Description: Java实现埃氏筛法的程序，快速求出100以内素数，适合初学者参考-Java program to achieve Erichsen Sift quickly find prime numbers less than 100, suitable for beginners reference
Platform: |
Size: 2048 |
Author: |
Hits:
Description: Arrays and Matrices
1 Sieve of Eratosthenes
counting primes
arrays in numpy
2 Matrices
defined functions
finding the minimum
finding saddle points-Arrays and Matrices
1 Sieve of Eratosthenes
counting primes
arrays in numpy
2 Matrices
defined functions
finding the minimum
finding saddle points
Platform: |
Size: 261120 |
Author: mohammed |
Hits:
Description: Find out all the primes in set numbers, use Sieve of Eratosthenes approach.
Platform: |
Size: 1024 |
Author: 张三 |
Hits:
Description: Sieve of Eratosthenes algorithm for finding all prime numbers up to a whole number n.
Platform: |
Size: 12288 |
Author: Vlad |
Hits:
Description: 压缩包里包含几个用C编写的并行代码，运行无误。其中包括，电路满足性的MP程序，floyd算法MPI代码，Sieve_Eratoshenes筛法MPI代码，矩阵相乘的MPI代码以及计算PI值的OpenMP代码。-Which contains several parallel programs written in C to run correctly. Among them, including Floyd algorithm procedures, matrix multiplication MPI program, Eratosthenes sieve method MPI program, to meet the circuit of PMI program and to calculate the value of PI OpenMP program.
Platform: |
Size: 20480 |
Author: 刘建凯 |
Hits:
Description: 《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-" MPI and OpenMP parallel programming (C language version)" is Michael J.Quinn Professor Oregon State University in the years written in a lecture on " parallel programming" course, based on the C language introduces, and in conjunction with MPI and OpenMP parallel programming, including parallel architectures, parallel algorithm design, message passing programming, Eratosthenes sieve method, Floyd algorithm, performance analysis, matrix-vector multiplication, document classification, Monte Carlo method, matrix multiplication, linear equations solving finite difference method, sorting, fast Fourier transform, a combination of search, shared memory programming, integration OpenMP and MPI and five appendices.
Platform: |
Size: 48901120 |
Author: 艾艾 |
Hits:
Description: 埃拉托色尼筛法（Sieve of Eratosthenes）是一种用来求所有小于N的素数的方法。从建立一个整数2~N的表着手，寻找i˂ 的整数，编程实现此算法，并讨论运算时间-The Sieve of Eratosthenes is a method for finding all primes smaller than N. From the establishment of an integer 2 ~ N of the table to start looking for i ˂ integer, programming to achieve this algorithm, and discuss the computing time.
Platform: |
Size: 1024 |
Author: 齐洁 |
Hits:
Description: 51个经典的算法，例如
Algorithm Gossip: 生命游戏
Algorithm Gossip: 字串核对
Algorithm Gossip: 双色、三色河内塔
Algorithm Gossip: 背包问题（Knapsack Problem）
Algorithm Gossip: 蒙地卡罗法求PI
Algorithm Gossip: Eratosthenes 筛选求质数
Algorithm Gossip: 超长整数运算（大数运算）
Algorithm Gossip: 长PI
Algorithm Gossip: 最大公因数、最小公倍数、因式分解
Algorithm Gossip: 完美数
Algorithm Gossip: 阿姆斯壮数(51 classic algorithms)
Platform: |
Size: 1076224 |
Author: ljke |
Hits: