Prime number program with less iterations in java
What you will learn here about java
- Prime number program with less iterations in java
Write a program to check whether number is prime or not is one of the common interview program in java. Here we will whether number is prime or not with less iterations or computations.
Prime number program with less iterations in java
Code to check whether number is prime or not with less iterations in java is given below
public class PrimeNumber { public static void main(String[] args) { int number=71; int prime=PrimeNumber.isPrime(number); if(prime==0) { System.out.println(number+" is prime number"); } else { System.out.println(number +" is NOT prime number"); } } static int isPrime(int number) { if(number==2) return 1; for(int i=2;i*i<number;i++) { if(number%i==0) { return 0; } } return 1; } }
OUTPUT
71 is NOT prime number