Fundamentals of Algorithms

CS502-Fall 2010
Assignment No.01
Student Name:
Student Id:
Question 1 (10)
Find the running time complexity of the following piece of code and show
your working step by step.
y=0;
x=0;
for (i=n; i>0;i=i-1) n-time
{ y=y+1;} n-time
for (i=1;i<=n;i=i*3) log3
n
{
for (j=1;j<=3n;++j) n
2
+1
{
for(k=0;k<n; k=k+5) 2n-1
{
x=x+5;
}
}
}
Question 2 (10)
Solve the following recurrence relation using iterative method
and make proper assumptions for final solution and give
answer at end in asymptotic form.
( )
( )
( ) ( )
( )
( )
( )
( )
1 1
( )
4 / 5 1
1 1
4 / 5
4 4 / 25 / 5
16 / 25 4 / 5
16 4 /125 / 25 4 / 5
64 /125 16 / 25 4 / 5
.........................................................
...........
if n
T n
T n n if n
T and
T n T n n
T n n n
T n n n
T n n n n
T n n n n


' ;


1
]
1
]

+ >

+
+ +
+ +
+ + +
+ + +
( ) ( )
( ) ( )
( ) ( )
( )
( )
( ) ( )
( )
( )
( )
...............................................
1 1
4 / 5 4 / 5 ........... 16 / 25 4 / 5
0
4 / 5 4 / 5
1
5 1 1
1
4 / 5 4 / 5
0
log
log
4 1 4 / 5
0
log
log & 4 / 5 4/
k k k
T n n n n n
i
k i i
T n n
k
k
with n and T
k
k k i i
T n T n n
i
n
n
i i
T n
i
n
i i
we use a n a

+ + + + +

k
k
( )
( ) ( )
5
log
log4
4/ 5
0
i
n
i
T n n n
i
+

( )
( )
, 1
1
1
1
0
4/ 5 log 1.
2
4/ 5log 1 1
log4
2
4/ 5 1
log
log 4
log 4 log 5 log 4 1
2
2 2 2
4/ 5 log
2
Thesumis a gemetric series recall that for x
m
m
x
x
i
x
i
inthis case x and m n we get
n
T n n n
Applying the identifyoncemore
n
n n n
n

+
+

( )
( ) ( )
,
log 4
2
log 4
1
2 log 4 log 4
2 2
4/ 5 1 1/ 5
log 4 log 4 log 4
2 2 2
5 5 4
log 4 0.86
2
log 4
0.86
2
5 4 5 4
If we plug thisback we get
n
n n
n
T n n n n n
n n n n n
with we finally havetheresult
T n n n n n n
_


,

+ +

+ +

+ +