Answer Posted / dharanya

Answer
# 10

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 call a function with an argument list built up at run time?

1242

---

What are preprocessor directives in c?

1094

---

Write a progarm to find the length of string using switch case?

2067

---

What is operator precedence?

1204

---

What is meant by type specifiers?

1128

---

Who is the founder of c language?

1162

---

Why can't I perform arithmetic on a void* pointer?

1094

---

explain what is fifo?

1069

---

simple program of graphics and their output display

1994

---

Which are low level languages?

1089

---

Write a program to generate a pulse width frequency of your choise,which can be variable by using the digital port of your processor

3538

---

Is it possible to execute code even after the program exits the main() function?

1336

---

writ a program to compare using strcmp VIVA and viva with its output.

2022

---

What is c variable?

1042

---

a program that can input number of records and can view it again the record

1909

---