Increase count to 16384. Simplify complex expression.

git-svn-id: svn://svn.cc65.org/cc65/trunk@4064 b7a2c559-68d2-44c3-8de9-860c34a00d81

diff --git a/samples/sieve.c b/samples/sieve.c
index b2fc9cdbc7eef5e3fedd327579e7cdf84a8e15dc..7294954dccf7f52bf7245076676067fc888f667c 100644 (file)
--- a/samples/sieve.c
+++ b/samples/sieve.c
@@ -18,8 +18,8 @@
 
 
 
-#define COUNT          8192            /* Up to what number? */
-#define SQRT_COUNT     91              /* Sqrt of COUNT */
+#define COUNT          16384           /* Up to what number? */
+#define SQRT_COUNT     128             /* Sqrt of COUNT */
 
 static unsigned char Sieve[COUNT];
 
@@ -68,7 +68,8 @@ int main (void)
     while (I < SQRT_COUNT) {
        if (Sieve[I] == 0) {
            /* Prime number - mark multiples */
-           S = &Sieve[J = I*2];
+            J = I*2;
+           S = &Sieve[J];
                    while (J < COUNT) {
                *S = 1;
                S += I;