Algorithm3 packs the sieve more tightly than regular odds-only (ie. in wheel6 formation, 2 bits per 6 numbers). Other than that, it's pretty much straight-up Eratosthenes. The clever flip-flops (k = 3 - k and ij = t - ij) disappear when the loops are unrolled (by hand or by compiler).
All in all, I don't expect this algorithm to hold much interest.
In reply to Re: The sieve of Xuedong Luo (Algorithm3) for generating prime numbers
by Anonymous Monk
in thread The sieve of Xuedong Luo (Algorithm3) for generating prime numbers
by marioroy
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |