 |
| Topic |
L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem
 |
| Lecture |
 |
| Notes |
|
| Topic |
L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm
|
| Lecture |
|
| Notes |
|
| Topic |
L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment