Find all prime numbers up to any given limit

Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
For example, if n is 10, the output should be “2, 3, 5, 7″. If n is 20, the output should be “2, 3, 5, 7, 11, 13, 17, 19″.

The Sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so.

Following is the algorithm to find all the prime numbers less than or equal to a given integer n by Eratosthenes’ method:

1. Create a list of consecutive integers from 2 to n: (2, 3, 4, …, n).
2. Initially, let p equal 2, the first prime number.
3. Starting from p, count up in increments of p and mark each of these numbers greater than p itself in the list. These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.
4. Find the first number greater than p in the list that is not marked. If there was no such number, stop. Otherwise, let p now equal this number (which is the next prime), and repeat from step 3.

When the algorithm terminates, all the numbers in the list that are not marked are prime.

public List<Integer> findPrimeNumbers(int n) { 
	boolean[] isPrime = new boolean[n+1];
	Arrays.fill(isPrime, 2, n+1, true);
	for(int i=2; i*i <= n; i++) {
		if(isPrime[i]) {
			for(int j = i; i*j <= n; j++) {
				isPrime[i*j] = false;
			}
		}
	}
	// output all prime numbers
	List<Integer> result = new ArrayList<>();
	for(int i=0; i<=n; i++) {
		if(isPrime[i]) {
			result.add(i);
		}
	}
	return result;
}