Assignment 106; Prime

Code

    // Donovan Rich
    // Period 6
    // Prime.java
    // 3/31/2016
    
    public class Prime
    {
        public static void main(String[] args)
        {
            for (int x = 2; x <= 100; x = x + 1)
            {
                System.out.print(x);
                if (isPrime(x) == true)
                {
                    System.out.print("<");
                    System.out.println();
                }
                else
                    System.out.println();
            }
        }
        public static boolean isPrime(int n)
        {
            int primeZero=0;
            for (int m = 2; m < n; m = m + 1)
            {
                if (n%m == 0)
                    primeZero++;             
            }
            
            if ( primeZero == 0 )
                return true;
            else
                return false;
            
        }
    } 
        

Picture of the output