Assignment 106

public class PrimeFinder
{
     public static void main( String[] args )
     {
         for (int n=2; n<=100; n++)
         {
             if (isPrime(n))
                 System.out.println(n);
         }
     }
      
     public static boolean isPrime(int n)
     {
         boolean result = true;
         for (int i=2; i<n; i++)
         {
             if (n%i==0)
             {
                 result = false;
                 i = n;
             }
         }
         
         return result;
     }
}