T (n) = 3T(n/3) + n^3

Показать описание

This is a video showing how you can solve T (n) = 3T(n/3) + n^3 using the iteration method.
Tutorial:

Master Theorem Videos to solve T(n) Recurrence:

Please subscribe !

►Discrete Mathematics Workbooks:

Рекомендации по теме

Комментарии

I don't usually comment on videos, but you literally saved me!

MrGreenivo

you just saved me from failing in analysis of algorithms
great job sir

granitfazliu

Please, let me tell you something "YOU ARE BRILLIANT" keep going

OmranAlHadad

you literally should design this as a course on Coursera. I'm taking the Stanford Algorithm course and they cover this but not as step-by-step and friendly as your line by line approach. They are very math heavy and I can understand it but I have to review your videos after watching theirs.

Chansd

Thanks, my uni wants me to solve these using this method so im glad you made a video about it 😊

zeeeeeeeeeev

Hey, how did you get to the point that 1/9^log base 3 of n = n^2?

elvan

I have an assignment in that they asked the same above question to solve it using characteristics roots method. Please share some article related if possible. I couldn't find these kind of indeterminate forms

gladyouseen

Question for you Mr. Anderson, if you have a minute: Can you tell me how 1/9 log 3 n becomes 1/n^2? (@ 12:00) I’ve been searching for the law of logs that applies and can’t find it.

MemoryException

Just wondering at the end of the solution, how did you decide that T(n) belongs to Big-Theta notation, rather than Big-O or Big-Omega? Thanks

leonugraha

Thanks a lot. You explain better than my textbook.

mrloldude

don't usually comment on videos, but thaaaanks man

plz more exampel

mossabkhdaer

Sir plese tell about substitution method in which we guess before solving the recurrence .

achin

Thanks for your clear video! It's very helpful to me!

夏祭春灯

Can you please upload a video on how to solve optimal binary search tree using dynamic programming approach.

ankittiwari

@7:53 why is it 1-a^n/1-a instead of 1-a^(n-1)/1-a ?

coletraindubstep

This was the most amazing guide, and it saved my life. Thank you so much for saving me from my tears :D

olwyndoyle

Thanks a lot Mr. Anderson, very helpful!

abdulrahmanaulabi

I swear it's true ...
" Literally you saved me "
I do not usually subscribe or comment on videos but Please keep going ^^)

ayawael

Ohh my god, just have explained it just like my best algo teacher .

Keep uploading such videos. I wish if i find your channel before

anuragdutt

could you do the characteristic equation for T (n) = 3T(n/2) + n^3?

ellendeoliveiramelo

T (n) = 3T(n/3) + n^3

T (n) = 3T(n/3) + n^3

Recurrence Problem T(n) = 3T(n/3) + n

Solving T(n) = 3T(n/3)+sqrt(n) using master method

Solving T(n) = 3T(n/3)+sqrt(n) in terms of or O notions using master method

Recurrence Relation T(n)= T(n/3) + T(2n/3) + cn | Recursive Tree Method | GATECSE | DAA

Recursion Tree Method

Computer Science: Recurrence Problem $T(n) = 3T(n/3) + n$ (2 Solutions!!)

Lec 3.7: Recurrence Tree Method | T(n) = T(n/3) +T(2n/3) +n | Recurrence Relation in DAA

L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm

Solving T(n) = 3T(n/3)+n/2 using master method (5 Solutions!!)

Does the master theorem apply to T(n) = 3T(n/3) + nlogn?

Master Method for Solving Recurrences (Dividing Function Example video)

Recurrence Relation [ T(n)= 3T(n/4) + C.n^2 ] | Recursion Tree Method | Example#3 | Algorithm

Recurrence Relation T(n)= 3T(n/4) +n^2 | Recursive Tree Method | GATECSE | DAA

Iteration Method To Solve Recurrence Relation (Data Structure and Algorithms)

DAA Session 5B: Recursion tree method Examples | T(n) = 2T(n/2) + C | T(n)=T(n/3)+T(2n/3)+n

Solve T(N)=3T(N/2)+N

MASTER RECURRENCE RELATION FOR DIVIDE AND CONQUER | ALGORITHMS | SOLVING RECURRENCE RELATION | Jatin

Recurrence relation T(n) = 3T(n-1) + n

Part - 4 | RECURRENCE TREE Method | T(n) = T(n/5) +T(n/3)+ T(n/2) +c | Solve the Recurrence Relation

DAA Session 5D: Recursion Tree to find Time Complexity of T(n)= 3T(n/4) + cn^2 | CS fundamentals

In question: Solve the following recurrence relation using the iteration method: T(n) = 3T(n/3) + n…...

Lec 3.2: Substitution Method in DAA | Recurrence Relation | T(n) = 3T(n-1) | Design and Analysis

Solving the recurrence T(n) = 3T(n-2) with iterative method (2 Solutions!!)