ALGORITHMO #11 - Sieve of Eratosthenes Algorithm Implementation

ALGORITHMO-11-Sieve-of-Eratosthenes-Algorithm-Implementation.java

public class Solution {
	
	static void sieveOfEratosthenes(int n) {
		boolean sieve[] = new boolean[n+1];
		int i = 2, j = 0;
		
		while (i <= n) {
			if (sieve[i] == false) {
				System.out.print(i + " ");
				j = i * i;
				while (j <= n) {
					sieve[j] = true;
					j += i;
				}
			}
			++i;
		}
	}
	
	public static void main(String[] args) {
		sieveOfEratosthenes(199);
	}
}