Question

Deduce the time complexity of the following algorithm using
frequency based method.

int k = 0;
for (int i = 0; i <= n/2; i+ = n/2)do
k + = i*j;
for (int j = 0; j <n/2: j ++) do
Print(i+j);
end
end​

Answer 1

I don't know why so serious JOKER

najsjshdb so eh is I will wi