prime generator: generate all prime that less than n in asc order - Java java.lang

Java examples for java.lang:int prime

  1. HOME
  2. Java
  3. java.lang
  4. int prime

Description

prime generator: generate all prime that less than n in asc order

Demo Code


//package com.java2s;
import java.util.ArrayList;
import java.util.List;

public class Main {
    /**/*from  ww  w.j  a va  2  s. com*/
     * prime generator: generate all prime that less than n in asc order
     * 
     * @param n
     * @return List<Integer>
     */
    public static List<Integer> GeneratePrime(int n) {
        boolean[] a = new boolean[n];
        List<Integer> p = new ArrayList<Integer>();
        for (int i = 2; i < n; ++i) {
            if (!(a[i]))
                p.add(i);
            for (int j = 0; (j < p.size() && i * p.get(j) < n); ++j) {
                a[i * p.get(j)] = true;
                if (i % p.get(j) == 0)
                    break;
            }
        }
        return p;
    }
}

Related Tutorials