Java入门：基础算法之检查素数

import java.util.Scanner;
class PrimeCheck
{
   public static void main(String args[])
   {        
    int temp;
    boolean isPrime=true;
    Scanner scan= new Scanner(System.in);
    System.out.println("Enter a number for check:");
    //capture the input in an integer
    int num=scan.nextInt();
    for(int i=2;i<=num/2;i++)
    {
           temp=num%i;
       if(temp==0)
       {
          isPrime=false;
          break;
       }
    }
    //If isPrime is true then the number is prime else not
    if(isPrime)
       System.out.println(num + " is Prime Number");
    else
       System.out.println(num + " is not Prime Number");
   }
}

Enter a number for check:
19
19 is Prime Number