Welcome to the Java Programming Forums

The professional, friendly Java community. 21,500 members and growing!

The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.


Members have full access to the forums. Advertisements are removed for registered users.

View RSS Feed


  1. Optimizing the Sieve of Eratosthenes

    The Sieve of Eratosthenes is one of the fastest methods for generating a list of prime numbers less than a given number n. A general description of the algorithm is given below:

    1. Initialize a list representing the numbers [2,n). This denotes whether a given number is prime or composite.
    2. Start from the beginning of the list. If the number is denoted as prime, save it. Otherwise, move on.
    3. For every multiple of the current prime, mark it as a composite number. ...

    Updated September 29th, 2012 at 06:26 PM by helloworld922