Answer Posted / china

Find all primes not larger than N.
I think it is the most efficient algorithm to find all
primes no larger than N.

int main(void)
{
int i,j, N;
int *pPrimes;
int nPrimes, is_prime;
printf("Input N:");
scanf("%d", &N);

pPrimes = new int [N/2];
nPrimes = 0;
for(i = 2; i<=N; i++)
{
is_prime = 1;
for(j=0;j<nPrimes; j++)
if (i%pPrimes[j] == 0)
{
is_prime = 0; break;
}
if (is_prime)
{
pPrimes[nPrimes++] = i;
}
}

printf("%d primes found less than %d:\n", nPrimes, N);
for (i=0; i< nPrimes; i++)
printf("%d ", pPrimes[i]);

}

How can I find the modification date of a file?

1337

---

What is the equivalent code of the following statement in WHILE LOOP format?

1343

---

Why do we use int main instead of void main in c?

1199

---

What does node * mean?

1304

---

Can you pass an entire structure to functions?

1173

---

What are the types of macro formats?

1163

---

Should I learn c before c++?

1298

---

What does 2n 4c mean?

1310

---

What is the use of pointers in C?

1133

---

What is the best organizational structure?

1170

---

How do we declare variables in c?

1117

---

Describe wild pointers in c?

1166

---

What are 'near' and 'far' pointers?

1091

---

What is formal argument?

1190

---

What is return type in c?

1189

---