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

Answer / natalija

I got one question! how can i make program in LSL (linden->second life script language) for prime numbers...not to cheek, but for readouot prime numbers?

Answer / neetu singh

#include<iostream.h>
#include<conio.h>
void main()
{
int n,i;
for(i=0;i<10;i++)
{
if(n<=o)
}
{
cout<<"number is prime");
cout<<"number is not prime");
getch();
}

why little endian and big endian came?y they using differently? y they not used commonly ?wt is application of little and big ?

1 Answers  

---

What is a stream?

0 Answers  

---

In c language can we compile a program without main() function?

0 Answers  

---

Is reference used in C?

1 Answers  

---

how can i get the string which is having two spaces at the end.suppose the string is "Hello World ".Now at the end i have two spaces.i need to print with that spaces .

1 Answers  

---

Give the Output : * * * * * * * * * *

2 Answers  

---

What are the Advantages of using macro

0 Answers  

---

What would happen to X in this expression: X += 15; (assuming the value of X is 5)

0 Answers  

---

#define f(g,h) g##h main O int i=0 int var=100 ; print f ("%d"f(var,10));} what would be the output?

1 Answers   Wipro,

---

What is Full Form of C and Why We use C

23 Answers  

---

What is dynamic dispatch in c++?

0 Answers  

---

i want to job in your company, so how it will be possible.

3 Answers   TCS,

---