Sieve of Eratosthenes in Java

Main.java

import java.util.Arrays;
import java.util.stream.IntStream;

class Main {
    public static int[] simpleSieve(int limit) {
        boolean[] isPrime = new boolean[limit + 1];
        Arrays.fill(isPrime, true);

        for (int n = 2; n <= limit; n++) {
            if (isPrime[n]) {
                for (int m = n * n; m <= limit; m += n) {
                    isPrime[m] = false;
                }
            }
        }

        return IntStream.rangeClosed(2, limit).filter(n -> isPrime[n]).toArray();
    }

    public static void main(String[] args) {
        int[] primes = simpleSieve(100);
        System.out.println(Arrays.toString(primes));
    }
}