Scribd
Upload
15 views2 pages

Data Structures and Algorithms Exercise 1 Time Complexity and Big-Oh

For the students of Data Structures its a good exercise to practice big-Oh concepts and calculating time complexity of different loops.

Uploaded by

Hamza Chaudhry
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
15 views2 pages

Data Structures and Algorithms Exercise 1 Time Complexity and Big-Oh

For the students of Data Structures its a good exercise to practice big-Oh concepts and calculating time complexity of different loops.

Uploaded by

Hamza Chaudhry
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures and Algorithms

Exercise 1
Time Complexity and Big-Oh
Assume that basic operations and input output take single time units to complete. Calculate the time
complexity function T(n) and O(n) for the following program fragments:
1.

5.
int sum,i;
sum = 0;
for (i=1;i<n;i=i*5)
sum++;

int sum,i,j;
sum = 0;
for (i=0;i<n;i=i+5)
{
for (j=0;j<n;j=j+2)
{
sum++;
}
}

2.
int sum,i,j;
sum = 0;
for (i=0;i<n;++i)
{
for (j=0;j<i;++j)
{
sum++;
}
}

6.
int sum,i,j;
sum = 0;
for (i=n;i>=1;i=i-3)
{
for (j=n;j>0;j=j-5)
{
sum++;
}
}

3.
int sum,i,j,j;
sum = 0;
k=0;
for (i=1;i<=n;i=i*3)
{
k=0;
sum++;
for (j=1;j<=i;++j)
{
k=k+1;
}
cout << k;
}
4.
int sum,i;
sum = 0;
for (i=0;i<n;i=i+2)
sum++;

(continued on next page)

7.
int sum,i,j;
sum = 0;
for (i=1;i<n;i=i*2)
sum++;
8.

int sum,i,j;
sum = 0;
for (i=1;i<=n;i=i*2)
{
for (j=1;j<=i;j=j*2)
{
sum++;
}
}

9.
for (i=1;i<=n;++i)
{
cout << i;
Sum=0;
for (j=1;j<=i;++j)
{
Sum++;
cout << i;
}
cout << Sum;

11.
for (i=1;i<n;i=i*4)
{
cout << i;
for (j=0;j<n;j=j+2)
{
cout << j;
sum++
}
cout << sum;
}

}
10.
sum = 0;
for (i=1;i<=n;i=i*2)
{
cout << i;
cout << sum;
for (j=1;j<=i;++j)
{
cout << j;
cout << *;
sum++;
}
sum =0;
}

12.
for (i=0;i<n;i=i+3)
{
cout << i;
for (j=1;j<n;j=j*3)
{
cout << j;
sum++
}
cout << sum;
}

You might also like