 |
| Topic |
L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm
 |
| Lecture |
 |
| Notes |
|
| Topic |
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
|
| Lecture |
|
| Notes |
|
| Topic |
L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment