Comments on: The Sieve of Atkin in C# http://www.geekality.net/2009/10/19/the-sieve-of-atkin-in-c/ With a hint of Social Ineptitude Fri, 09 Jul 2010 20:04:05 +0000 hourly 1 http://wordpress.org/?v=3.0.1 By: Mark Lawrence http://www.geekality.net/2009/10/19/the-sieve-of-atkin-in-c/#comment-468 Mark Lawrence Sat, 22 May 2010 23:26:59 +0000 http://www.geekality.net/?p=674#comment-468 Ok I don't know c# that well, but in your nested x/y for loops you compute both x * x and y * y three times, and 3 * x * x twice, could you compute these once only by using temporary variables? The third computation of n is done, then you check that x > y, why not perform this check first, then do the computation? Ok I don’t know c# that well, but in your nested x/y for loops you compute both x * x and y * y three times, and 3 * x * x twice, could you compute these once only by using temporary variables? The third computation of n is done, then you check that x > y, why not perform this check first, then do the computation?

]]> By: <img src='http://www.geekality.net/wp-content/plugins/rpx/images/openid.png'/> Torleif http://www.geekality.net/2009/10/19/the-sieve-of-atkin-in-c/#comment-216 Torleif Wed, 17 Mar 2010 18:16:23 +0000 http://www.geekality.net/?p=674#comment-216 According to my unit test it seems to work at least, so thanks! :) According to my unit test it seems to work at least, so thanks! :)

]]> By: Greg http://www.geekality.net/2009/10/19/the-sieve-of-atkin-in-c/#comment-180 Greg Sat, 20 Feb 2010 21:46:09 +0000 http://www.geekality.net/?p=674#comment-180 In the line [cc lang="csharp"]for (ulong n = 5; n <= limit; n++)[/cc] could you use [cc lang="csharp"]for (ulong n = 5; n <= limit; n += 2)[/cc] so you aren't checking to see if even numbers are primes? In the line

for (ulong n = 5; n &lt;= limit; n++)

could you use

for (ulong n = 5; n &lt;= limit; n += 2)

so you aren't checking to see if even numbers are primes?

]]>