my self writed prime arithmetic

//质数的算法

boolean isprime;
List primeList = new ArrayList();

for(int i=1; i<=100; i++){
    isprime = false;
    for(int ii=2; ii<=i-1; ii++){
if(i%ii == 0){
    System.err.println("i:" + i + " ii:" + ii);
    isprime = true;
    break;
}
     }

     if(!isprime){
primeList.add(i);
      }
}
System.err.println(primeList);