Java Program to find Prime Numbers From 1 to N?

Below Example shows how to find all Prime Numbers from 1 to N.

public class PrimeNumbersFromOneToN {

public void allPrimeNumbers(int num){
System.out.println("Prime Numbers From 1 to "+num);
for(int i=1;i<num;i++){
boolean isPrime = true;
for(int j=2;j<i;j++){
if(i % j == 0){
isPrime = false;
break;
}
}
if(isPrime){
System.out.print(i+",");
}

}
}
public static void main(String[] args) {
PrimeNumbersFromOneToN p = new PrimeNumbersFromOneToN();
p.allPrimeNumbers(100);
}

}

Program Output :-

Prime Numbers From 1 to 100
1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,