下面 init_sieve 函数的时间复杂度为( )。
init_sieve
int sieve[MAX_N]; void init_sieve(int n) { for (int i = 1; i <= n; i++) sieve[i] = i; for (int i = 2; i <= n; i++) for (int j = i; j <= n; j += i) sieve[j]--; }
O(n)O(n)O(n)
O(nloglogn)O(n \log \log n)O(nloglogn)
O(nlogn)O(n \log n)O(nlogn)
O(n2)O(n^2)O(n2)