Q38

MCQ2 marks, −0.67

Consider the following C function int fun(int n) { int i, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf("%d %d", i, j); } } } Time complexity of $fun$ in terms of $\Theta$ notation is

(A)

$\Theta(n \sqrt{n})$

(B)

$\Theta(n^2)$

(C)

$\Theta(n \: \log n)$

(D)

$\Theta(n^2 \log n)$

Loading…