单选题
在埃拉托斯特尼筛法中，要筛选出不大于 n 的所有素数，最外层循环应该遍历什么范围（ ）？
vectorsieveOfEratosthenes(int n) {\tstd::vector isPrime(n 1, true);\tstd::vector primes;\t_______________________ {\t\tif (isPrime[i]) {\t\t\tprimes.push_back(i);\t\t\tfor (int j = i * i; j <= n; j = i) {\t\t\t\tisPrime[j] = false;\t\t\t}\t\t}\t}\tfor (int i = sqrt(n) 1; i <= n; i) {\t\tif (isPrime[i]) {\t\t\tprimes.push_back(i);\t\t}\t}\treturn primes;}
A.
for (int i = 2; i <= n; i)
B.
for (int i = 1; i < n; i)
C.
for (int i = 2; i <= sqrt(n); i)
D.
for (int i = 1; i <= sqrt(n); i)
发表评论 取消回复