Java to find up to 100 prime examples to share
- 2020-04-01 03:06:03
- OfStack
Problem: find primes within 100
Method one:
package airthmatic;
public class demo8 {
public static void main(String arg[])
{
for(int i=1;i<=100;i++)
{
if(find(i))
System.out.print(i+" ");
}
}
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 a prime number ");
}
}
}