Question 1 of 8

Question

What is time complexity of fun()?

int fun(int n)
{
  int count = 0;
  for (int i = 0; i < n; i++)
     for (int j = i; j > 0; j--)
        count = count + 1;
  return count;
}

Answer 1

$\theta(n^2)$

Answer 2

$\theta(nlogn)$

Answer 3

$\theta(n)$

Answer 4

$\theta(logn)^2$

Test on time complexity