Professional Documents
Culture Documents
Recurrence Relation
Time Complexity of Recursive Algorithms Example 1
if (n = = 0 )
return 1;
else
return n * factorial (n-1);
}
Recurrence Relation:
-------------------
+k k
+n
+n
¿ 1+n = n+1
Time Complexity of Recursive Algorithms Example 2
++n 3
-------------------
¿ 𝑇 (𝑛 − 𝑘 ) k
Time Complexity of Recursive Algorithms Example 2
++n 3
-------------------
¿ 𝑇 (𝑛 − 𝑘 ) + . . .+ n k
Time Complexity of Recursive Algorithms Example 2
-------------------
¿ 𝑇 (𝑛 − 𝑘 ) + . . .+ n k
¿ 𝑇 (𝑛 − 𝒏) + . . .+ n
¿ 𝑇 ( 0) + . . . + n
¿ 1 + ¿1 + + ¿+
Time Complexity of Recursive Algorithms Example 3
] + log n
----------------------------------
¿ 𝑇 (𝑛 − 𝑘 ) k
Time Complexity of Recursive Algorithms T(n) ¿ 𝑻 (𝒏 −𝟏)+ log n
¿ 𝑇 (𝑛 −2) + log n-1
T(n) = 1 for n=0 T(n) ¿ 𝑻 (𝒏 −𝟏)+ log n
T(n) ¿ 𝑇 (𝑛 − 1) + log n 1 ¿ 𝑇 (𝑛 −3) + log n-2
log (n-1) + log n
¿ 𝑇 (𝑛 − 2 ) +log ( n −1 )+ log n 2
] + log n
----------------------------------
¿ 𝑇 (𝑛 − 𝑘 ) + . . k
1 . 2 . 3 . 4 . . . . . . n ≤ nn = log 1 + log 2 . . .+ log (n-1)+log n
Time Complexity n! ≤ nn = log ( 1 . 2 . …. . (n-1) . n )
log n! ≤ log nn = log n!
T(n) = 1 for n=0 log n! ≤ n log n
Only we have T(0) = 1
T(n) ¿ 𝑇 (𝑛 − 1) + log n 1
𝒏− 𝒌=𝟎
¿ 𝑇 (𝑛 − 2 ) +log ( n −1 ) n
+ log 2
𝒌=𝒏
+ log ( n −2) + log (n −1)+ log n 3
----------------------------------
¿ 𝑇 (𝑛 − 𝑘 ) + . . . k
¿ 𝑇 (𝑛 − 𝑛 ) + . . .
¿ 𝑇 ( 0) + +...
¿ 1 +𝑙𝑜𝑔 𝑛!
Time Complexity of Recursive Algorithms Example 4
if (disk =1)
T(n) = 2 T(n-1) +
move disk from source to dest
else {
HanoiTower (n-1 , source, aux, dest )
move disk from source to dest
HanoiTower (n-1 , aux, dest, source)
}
}
Time Complexity of Recursive Algorithms Example 4
if (disk =1)
T(n) = 2 T(n-1) + 1 for n>1
move disk from source to dest T(1) = 1 for n=1
else {
HanoiTower (n-1 , source, aux, dest )
move disk from source to dest
HanoiTower (n-1 , aux, dest, source)
}
}
Time Complexity of Recursive Algorithms Example 4
+ +1 3
-------------------
¿ 2 𝑘 𝑇 ( 𝑛 −𝑘 ) k
Time Complexity of Recursive Algorithms Example 4
+ +1 3
-------------------
¿ 2 𝑘 𝑇 ( 𝑛 − 𝑘 )+ . . .+ k
Time Complexity = Example 4
References:
YouTube Link