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 you increase the size of a statically allocated array?

1082

---

What are the advantages of external class?

1072

---

Is it cc or c in a letter?

1029

---

What is the difference between null pointer and wild pointer?

1204

---

What is c language and why we use it?

1078

---

How can type-insensitive macros be created?

1173

---

C language questions for civil engineering

1722

---

What is keyword in c?

1017

---

Implement bit Array in C.

1157

---

ATM machine and railway reservation class/object diagram

5253

---

What does it mean when a pointer is used in an if statement?

1113

---

Differentiate between the expression “++a” and “a++”?

1258

---

How do you define structure?

1050

---

Explain what is a program flowchart and explain how does it help in writing a program?

1103

---

Why doesnt this code work?

1072

---