Question

Java BNF

How to write pseudocode for this snippet?

1. Java code for finding a prime number

public class Prime {

public static void main(String[] args) {

int num = 29;

boolean flag = false;

for(int i = 2; i <= num/2; ++i)

{

// condition for nonprime number

if(num % i == 0)

{

flag = true;

break;

}

}

if (!flag)

System.out.println(num + " is a prime number.");

else

System.out.println(num + " is not a prime number.");

}

}

Answer 1

SOLUTION:

BEGIN
   Initialize num to 29
   Initialize flag to false
   for each i in [2,num/2]
       IF num%i==0
   update flag as true
break
END IF
ENDFOR
if(!flag)
System.out.println(num+" is a prime number")
else
System.out.println(num+" is not a prime number")
ENDIF

END