Lecture -13

Design and Analysis of Algorithms

1
2
Binary Record Algorithms

3
Binary Record Algorithms

4
Solution video

5
Substitution of Binary Record

6
Another Method

7
solution

8
BIN Record Cases

9
T(n)=2T(n/2)+n

10
Examples

11
12
 solution
• M(n)=M(n−1) + 2
• =[ M(n−2) + 2] + 2
• = M(n−2) + 2 + 2
• =[ M(n−3) + 2] + 2 + 2
• =M(n−3) + 2 + 2 + 2 = ...
• = M(n−i)+2 i = ... = M(1) + 2(n−1) = 2(n−1).

13
14
15