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]);

}

What is the role of this pointer?

1002

---

What is c programing language?

1055

---

What is ## preprocessor operator in c?

1035

---

Who developed c language and when?

1025

---

How will you delete a node in DLL?

1240

---

How can I implement sets or arrays of bits?

1004

---

What is an expression?

1013

---

Can we change the value of constant variable in c?

1014

---

How do you list files in a directory?

1090

---

Is swift based on c?

1062

---

What standard functions are available to manipulate strings?

1100

---

What is difference between class and structure?

1077

---

Write a program that accept anumber in words

1717

---

What are examples of structures?

1042

---

What are dangling pointers? How are dangling pointers different from memory leaks?

1245

---