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 are the standard predefined macros?

1154

---

Explain about the constants which help in debugging?

1383

---

Explain union.

1183

---

How many loops are there in c?

1122

---

Explain what are reserved words?

1116

---

How to explain the final year project as a fresher please answer with sample project

984

---

What is the method to save data in stack data structure type?

1097

---

What is structure in c definition?

1064

---

What are the two types of structure?

1102

---

What is printf () in c?

1099

---

Why is c platform dependent?

1100

---

Can you think of a logic behind the game minesweeper.

2476

---

Who developed c language and when?

1077

---

What is substring in c?

1215

---

How do c compilers work?

1147

---