ST:(homework 3)Some problems about Graph Coverage

package cn.tju.scs.printPrime;

public class Prime {
public static int MAXPRIMES = 30000;
public static boolean isDivisible(int a,int b){
int c = b%a;
if (c == 0){
return true;
}
else {
return false;
}
}
public static void printPrimes(int n){
int curPrime;
int numPrimes;
boolean isPrime;
int[] primes = new int [MAXPRIMES];

primes[0] = 2;
numPrimes = 1;
curPrime = 2;
while(numPrimes < n){
curPrime++;
isPrime = true;
for(int i = 0; i <= numPrimes - 1; i++){
if(isDivisible(primes[i],curPrime)){
isPrime = false;
break;
}
}
if(isPrime){
primes[numPrimes] = curPrime;
numPrimes++;
}
}

for(int i = 0; i <= numPrimes -1; i++){
System.out.println("Primes: " + primes[i]);
}

}

}

package cn.tju.scs.printPrime;

import static org.junit.Assert.*;

import org.junit.Before;
import org.junit.Test;

public class PrimeTest {

@Before
public void setUp() throws Exception {
}

@Test
public void test() {
Prime.printPrimes(3);
Prime.printPrimes(4);
Prime.printPrimes(1);
Prime p = new Prime();
}

}