6502/cc65
1
0
Fork 0
mirror of https://github.com/cc65/cc65.git synced 2024-10-31 20:06:11 +00:00
Code Issues Projects Releases Wiki Activity

Increase count to 16384. Simplify complex expression.

Browse Source 
git-svn-id: svn://svn.cc65.org/cc65/trunk@4064 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
uz 2009-08-28 17:21:58 +00:00
parent f66cd4a13f
commit 2a2c0fbaf1
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
samples/sieve.c
View File

@ -18,8 +18,8 @@
#define COUNT 8192 /* Up to what number? */ #define COUNT 16384 /* Up to what number? */
#define SQRT_COUNT 91 /* Sqrt of COUNT */ #define SQRT_COUNT 128 /* Sqrt of COUNT */
static unsigned char Sieve[COUNT]; static unsigned char Sieve[COUNT];
@ -68,7 +68,8 @@ int main (void)
while (I < SQRT_COUNT) { while (I < SQRT_COUNT) {
if (Sieve[I] == 0) { if (Sieve[I] == 0) {
/* Prime number - mark multiples */ /* Prime number - mark multiples */
S = &Sieve[J = I*2]; J = I*2;
S = &Sieve[J];
while (J < COUNT) { while (J < COUNT) {
*S = 1; *S = 1;
S += I; S += I;