输入100以内的质数用html,看一下这个程序(求100以内的质数),怎么简化一下算法...

简化寻找质数的算法

1。跳过一些数。如偶数。另外对于摸6同余的数(表示为6n，6n+1，6n+2，6n+3，6n+4，6n+5),只需要测试6n+1和6n+5是否为质数，这样问题规模缩小为原来的三分之一

2。只需要用已经找到的质数去测试整除性

#include

#define MAXSIZE 100

#define YES 1

#define NO 0

void main(void)

{

int prime[MAXSIZE]; /* array to contains primes */

int gap = 2; /* increasing gap = 2 and 4 */

int count = 3; /* no。

of primes */

int may_be_prime = 5; /* working variable */

int i, is_prime;

prime[0] = 2; /* Note that 2, 3 and 5 are */

prime[1] = 3; /* primes。

*/

prime[2] = 5;

while (count < MAXSIZE) { /* loop until prime[] full*/

may_be_prime += gap; /* get next number */

gap = 6 - gap; /* switch to next gap */

is_prime = YES; /* suppose it were a prime*/

for (i = 2; prime[i]*prime[i] <= may_be_prime && is_prime; i++)

if (may_be_prime % prime[i] == 0) /* NO */

is_prime = NO; /* exit */

if (is_prime) /* if it IS a prime。

。。

*/

prime[count++] = may_be_prime; /* save it */

}

printf("\nPrime Number Generation Program");

printf("\n===============================\n");

printf("\nFirst %d Prime Numbers are :\n", count);

for (i = 0; i < count; i++) {

if (i % 10 == 0) printf("\n");

printf("%5d", prime[i]);

}

}

。

全部