Find Prime Numbers in C# Using the Sieve of Eratosthenes - CodeProject

Click here to Skip to main content

Click here to Skip to main content

Alternative Tip

Stats

Comments & Discussions

Alternative to Find Prime Numbers in C# Using the Sieve of Eratosthenes

Here's an alternative. This one uses the BitArray class in C# and does not use the % operator.static List SeiveWithoutMod(int candidate){ BitArray sieveContainer = new BitArray(candidate + 1, true); int marker = 2; //start int factor = 2; //start. sieveContainer[0]...

Type	Tip/Trick
Licence	CPOL
First Posted	12 Sep 2011
Views	1,520
Bookmarked	0 times

C#maths

The Next Version of Android - Some of What's Coming

Get the Insider News free each morning.

Beginners Java Programming - 0703 Using The Scanner To Input Numbers

JavaScript: Function Parameters Part 2

Related Articles

Find Prime Numbers in C# Using the Sieve of Eratosthenes

Finding prime numbers

Eratosthenes/Sundaram/Atkins Sieve Implementation in C#

Finding prime numbers

Find Prime Numbers in C# Using the Sieve of Eratosthenes

Prime Number Determination Using Wheel Factorization

Bounded Buffer Sieve of Erastophenes

Finding Prime Numbers

Find Prime Numbers in C# Using the Sieve of Eratosthenes

A lazy stream implementation in C++11

Find Prime Numbers in C# Using the Sieve of Eratosthenes

Parallel Computing and Data Parallelism

Finding Primes: Part II – A Python Implementation

Comparing Ruby and C# Performance

Build your own cryptographically safe server/client protocol

Factoring Algorithms for Selected RSA Numbers

Improved Algorithm to compute the nearest possible prime number to an input pPrime

C# BigInteger Class

Template Meta Programming and Number Theory

Permalink | Advertise | Privacy | Mobile
Web01 | 2.6.130516.1 | Last Updated 12 Sep 2011

Article Copyright 2011 by Bill Anderson
Everything else Copyright © CodeProject, 1999-2013
Terms of Use

Layout: fixed | fluid