Lecture Notes on 9 Aug 2013

// Obtain all primes between 2 and 100 using 
// Sieve of Eratosthenes
import java.util.*;

public class Sieve
{
  public static void main (String[] args)
  {
    ArrayList<Integer> primes = new ArrayList<Integer>();

    // populate the ArrayList
    for (int i = 2; i <= 100; i++)
      primes.add(i);

    int idx = 0;
    while (idx < Math.sqrt (100))
    {
      int num = primes.get(idx);
      for (int j = idx + 1; j < primes.size(); j++)
      {
        if (primes.get(j) % num == 0)
	  primes.remove(j);
      }
      idx++;
    }

    for (int i = 0; i < primes.size(); i++)
      System.out.println (primes.get(i));
  }
}