Time Complexity of

Different Code Snippets

Analysis of Algorithm
Lecture # 3
Mariha Asad
 Time Complexity of Code Snippets(1)
for(i=0; i<n; i++) n+1
{
stmt; n
}
f(n) = n+1+n = 2n+1
So f(n) = O(n)
 Time Complexity of Code Snippets(2)
for(i=n; i >0; i--) n+1
{
stmt; n
}
f(n) = n+1+n = 2n+1
So f(n) = O(n)
 Time Complexity of Code Snippets(3)
for(i=0; i <n; i=i+2) n/2+1
{
stmt; n/2
}
f(n) = n/2+1+n/2 = n+1
So f(n) = O(n)
 Time Complexity of Code Snippets(4)
i
for(i=1; i <n; i=i*2) 1
{ (i*2)
stmt; 1*2 = 2
2*2 = 22
}
22 *2=23
i≥n .
.
Assume i = 2k .
.
2k ≥ n
2k
2k = n
k = log2n O(log2n )
 Time Complexity of Code Snippets(5)
for(i=n; i ≥ 1; i=i/2) i
{ n
stmt; i/2
} n/2
i<1 n/22
n/2k < 1 n/23
.
.
n/2k = 1 .

n=2k .

n/2k
k = log2n O(log2n )
 Time Complexity of Code Snippets(6)
for(i=0; i <n; i=i*2)
{
stmt;
}
?
 Time complexity
for(i=0; i <n; i++)
for(i=0; i <n; i=i+2)
for(i=n; i >1; i--)
for(i=1; i <n; i=i*2)
for(i=1; i <n; i=i*3)
for(i=n; i>1; i=i/2)
Thanks