Hello guys,

I'm struggling at my assignmnet.

I need your help.

for(int i=1; i<N; i++)

for(int j=1; j<N; j++)

for(int k=1; k <= i*j*log(j); k*=2) x=i+j+k;

Calculate runtimes using these inputs N = 10, 20, 40, 100, 200, 400, 1000, 2000, 4000, 10000,

based on the results, conjecture the complexity of the number of assignments performed. Prove your conjecture.

This is the question.

Using the timer class, I got runtime results as 0.004 ~ 0.005 for N=10000, 0.002 for N=4000, 0.001 for N=2000, and 0 for others.

Now, I don't know how to find the complexity from here.

Thank your for your help!!