Find Prime Numbers in C# Using the Sieve of Eratosthenes

Dennis_E

Rate me:

4.00/5 (1 vote)

20 Sep 2011CPOL

14.1K

This solution uses half the space by simply ignoring all even numbers. It will require a little index calculation. Also, primes are generated one by one instead of returning a list.Another optimization can be made by starting the crossing out of multiples of a prime p at p2. Any smaller number...

Views

Daily Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Dennis_E

Software Developer (Junior)

Netherlands

Software developer with a bachelor degree and a few years experience (studied computer science at a university as well, but didn't finish). Really love C#, but work usually involves Java. Some experience with VB and C as well.

When hobbying I almost exclusively use C# and AutoHotkey. In a previous life I did some Haskell and Modula-3 and similar stuff. I enjoy games and solving puzzles like on http://projecteuler.net/ (I think I'm stuck at level 4, though)

Find Prime Numbers in C# Using the Sieve of Eratosthenes

Views

License

Comments and Discussions