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 #define works?

1112

---

What are the differences between Structures and Arrays?

1216

---

write a sorting prgm to sort 50 nos and sum them and also remove all the occurrences of 15 and print it?

2139

---

The file stdio.h, what does it contain?

1168

---

What is the difference between exit() and _exit() function?

1047

---

What does c mean in basketball?

998

---

When should you not use a type cast?

1127

---

How can I write a function that takes a format string and a variable number of arguments?

1060

---

Does c have class?

1124

---

Can you please explain the difference between exit() and _exit() function?

1034

---

If a five digit number is input through the keyboard, write a program to print a new number by adding one to each of its digits.For example if the number that is input is 12391 then the output should be displayed as 23402

3922

---

What are header files in c?

1082

---

What is the difference between null pointer and wild pointer?

1201

---

Write a program on swapping (100, 50)

1131

---

What is the most efficient way to store flag values?

1192

---