“埃氏筛法”是一种高效的求N以内素数的算法,时间复杂度为O(nloglogn),求1000以内素数的“埃氏筛法”代码实现如下:
#include<cstdio>
#include<cmath>
int num[1001] = {0};
int primeCount = 0;
int prime[1001];
void findPrime() {
for (int i = 2; i <= 1000; ++i) {
if (!num[i]) {
primeCount++;
prime[primeCount] = i;
for (int j = 2 * i; j <= 1000; j += i) {
num[j] = 1;
}
}
}
}
int main() {
findPrime();
for (int i = 1; i < primeCount; ++i) {
if (i&&i % 10 == 0) printf("%3d\n", prime[i]);
else printf("%3d ", prime[i]);
}
}