关于Eratosthenes算法的介绍点击 Eratosthenes 筛选求质数。下面是其代码实现
package day03;
public class TestJava {
public static void main(String[] args) {
TestJava java = new TestJava();
//System.out.println(java.power(2, 12));
//java.hanuota('A', 'B', 'C', 3);
//System.out.println(java.gcd(12, 36));
//java.printPrime2(10, 1000);
java.printPrime(100);
}
//找出小于n的所有素数,Eratosthenes算法
public void printPrime(int n) {
boolean[] primes = new boolean[n + 1];
for (int i = 0; i < primes.length; i++) {
primes[i] = true;
}
for (int i = 2; i <= n / i; i++) {
if (primes[i]) {
for (int j = i; j <= n / i; j++) {
primes[i * j] = false;
}
}
}
int count = 0;
for (int i = 2; i <