Algorithm analysis

Given an analysis of the running time (Big-Oh notation) for each of the following 4 program fragments. Note that the running time corresponds here to the number of times the operation sum++ is executed. Sqrt is the function that returns the square root of a given number.

(a) sum =0;

for(i=0;<sqrt(n)/2;i++)

sum++;

for(j=0;<sqrt(n)/4;j++)

sum++;

for(k=0;k<8+j;k++)

sum++;

(b) sum = 0;

for(i=0;i<sqrt(n)/2;i++)

for(j=I;8+I;j++)

for(k=j;k<8+j;k++)

sum++;

(c) sum = 0;

for(i=1;i<2*n;i++)

for(j=1;j<i*I;j++)

for(k=1;k<j;k++)

if (j%i==1)

sum++;

(d) sum=0;

for(i=1;i<2*n;i++)

for(j=1;j<i*I;j++)

for(k=1;k<j;k++)

if(j%i)

sum++;

2. if it takes 10ms to run program (b) for n = 100, how long will it take to run for n=400?

[url removed, login to view] it takes 10ms to run program(a) for n = 100, how large a problem can be solved in 40ms?

C++ Programmierung Softwarearchitektur

Projekt-ID: #5125226

Über das Projekt