Write a program to print all prime numbers from 0 to N in Java

In this program I am discussing the easiest self implemented method to find all Prime Numbers between the range of 0 to 100-

import java.util.*;
public class Prime1
{
     public static void isPrime(int n)
{    
 int j,m=0;
            int flag=0;
     
if(n==0 || n==1){
                     System.out.println("Number is not prime"+n);}
else {
        
                    for(j=2;j<=n/2;j++)
            {
                    m=j;
               if(n%m == 0){
         flag=1;
              System.out.println("Number is not prime"+n); break;
        
            
//  
              } 
             
}

if(flag==0)
{

System.out.println("Number is prime"+n);
} } 
}

    public static void main(String[] args)
    {
           int i;
       for(i=0;i<100;i++)
            {
            
            isPrime(i);
       
            }        
            
          
             }
          
 
    }

#findprimenumber #printprimenumber