Java Generating Prime Number

/*
This class check the prime number between 1 to 1000 and write the prime number.
*/

public class PrimeNumber
{
// This method tests whether a given number is prime or not.
public static boolean isPrime ( int num )
{
boolean prime = true;
int limit = (int) Math.sqrt ( num );

for ( int i = 2; i <= limit; i++ )
{
if ( num % i == 0 )
{
prime = false;
break;
}
}

return prime;
}

public static void main ( String[] args )
{
// This loop writes out all the prime numbers less than 1000.
for ( int i = 2; i <= 1000; i++ )
{
if ( isPrime ( i ) )
System.out.println ( i );
}
}
}

Share and Enjoy: These icons link to social bookmarking sites where readers can share and discover new web pages.
  • Digg
  • del.icio.us
  • Netvouz
  • DZone
  • ThisNext
  • MisterWong
  • Wists
  • blogmarks
  • Furl
  • Reddit
  • Spurl
  • StumbleUpon
  • Technorati
  • YahooMyWeb

Tags: , , , , ,

Posted in Java



Leave a Reply