Design and Analysis of Algorithms

Worksheet I
Work on the following exercise to build your skills in solving the run time of algorithms with different
iterative patterns.
Identify the T(n) and tight bound (theta) of the following algorithms.

1. fun(n)
{
for i=1 to n
{
for j=1 to n
{
say "Hello"
}
}
}
2. fun(n)
{
for i=1 to i2 <=n
{
say "Hello"
}
}
3. fun(n)
{
for i=1 to n
{
for j=1 to i
{
for k=1 to 10
{
say "Hello"
}
}
}}

1
4. fun(n)
{
for i=1 to n
{
for j=1 to i2
{
for k=1 to n/2
{
say "Hello"
}
}
}
}
5. fun(n)
{
for i=1 to n by i=i*2
{
say "Hello"
}
}
6. fun(n)
{
for i=n/2 to n
{
for j=1 to n/2
{
for k=1 to n by k=k*2
{
say "Hello"
}
}
}
}

2
7. fun(n)
{
for i=n/2 to n
{
for j=1 to n by j=j*2
{
for k=1 to n by k=k*2
{
say "Hello"
}
}
}
}
8. fun(n)
{
for i=1 to n
{
for j=1 to n by j=j+i
{
say "Hello"
}
}
}