Monday, January 2, 2017

Prime no program in JAVA using recursive function

Simple and Easy program to find check for a number to be prime number in Java, using recursive function.

public class Prime
{
 public static void main(String[] args)
 {
  if(args.length<1 -1="" 0="" 1="" argument..="" boolean="" div-1="" div="=" else="" false="" if="" int="" is="" isprime="" no="" not="" nsufficient="" num="" pre="" prime..="" return="" static="" system.out.println="" true="">

1 comments so far


EmoticonEmoticon