Java to find prime numbers within 100 example sharing

Question: Find prime numbers within 100

Method 1:

 package airthmatic;public class demo8 { /** * Prime numbers refer to the number whose factor has only 1 and itself* @param arg */ public static void main(String arg[]) { for(int i=1;i<=100; i++) { if(find(i)) System.out.print(i+" "); } } /** * Prime numbers in 1-n natural numbers* @param n * @return */ public static boolean find(int n) { for(int i=2;i<=Math.sqrt(n);i++) { if(n%i==0) return false; } return true; }}

Method 2:

 public class Ex27 { public static void main(String args[]) { int sum,i; for(sum=2;sum<=100;sum++) { for(i=2;i<=sum/2;i++) { if(sum%i==0) break; } if(i>sum/2) System.out.println(sum+"is prime"); } }}