Sandhya.Kishan

 Profile Answers by Sandhya.Kishan 

• Jun 25th, 2012

 

static int getNumberOfPrime(int N) {
int count = 0;
for (int i=2; i<=N; i++) {
int max = (int)Math.sqrt(i);
boolean prime = true;
for (int j=2; j<=max; j++) {
if (i%j == 0 && i != j) {
prime = false;
break;
}
}
if (prime) {
count++;
System.out.print(i + ",");
}
}
return count;
}

Test case for prime numbers can be :
let the prime no be n
case1: expected o/p (prime no)result
divide the no n by 1 remainder=0 pass
divide the no n by n remainder=0 pass

divide the no n by 2 remainder!=0 pass
.
.
divide the no n by upto n-1 and if remanider not equal zero
then it is a prime no.