2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3

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

Recurrence Relation for Dividing Function

Example : T(n)= 2T(n/2) + n

Solved using Recursion Tree and Back Substitution Method

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

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

Комментарии

Sir, first of all, I am so thankful that I found someone who can teach and explain well. Keep doing well I learned more than I learned from my dumb professors..

vdharek

You have no idea how much i respect you! You are my favorite person on YouTube.

arnobchowdhury

His explanations are so calming for some reason.
.
As of late, all my teachers are southeast Asian. (Even at my university)
need to take a trip out there when after I graduate.
Great videos! Looking forward to going through your Algorithms playlist.

iTux

Thank you so much Sir. fyl this is my first comment on YouTube throughout these years, i have my Algorithm exam tmr and your teaching method is really good. was abt to cry thank you so much.. understand notations and recurrece relation which i thought i couldn't. The best

수정이-yg

I can't thank you enough for helping make what has been a challenging subject much clearer!

bagsssss

After going through the recurrence relation series, I’m able to do this myself as well. This is so eye opening, bravo!

saidhonorifov

Sir Bari, what a great explanation. You explained in 11 minutes what my teacher had done in 2 hours. I appreciate very much your help. You save me in my exam. Kind regards!

mvbmartins

Dislikers are the professors from the universities

mayurbhor

hello sir im a student from NIT trichy, my teacher mohan takes the subject very badly and gets paid lakhs of rupees, every student from entire nit trichy studies using your lectures, thank you sir 🙌

cryboi.twitch

What a master....
He is a life saver
Thankyou soo much Sir
I have seen your C++ playlist from Udemy. You are one of the best teacher I have ever seen.

irealabdullah

Sir, Your work is beyond my appreciation, you are true gem for us .

ShaniKumar-qlow

Every time I forget about time complexity and data structures I come by this great teacher's videos
May Allah grant you highest place in Jannah sir

BlackEswadeh

Hello Sir, You are the best teacher so far. Thank you for sharing your knowledge with us. God bless you and your family.

amberpradhan

You are a great lecturer. Thank you so much.

jamesbowen

Great explaination, you made it look ridiculously simple

mujib

watched it once, understood a little
watched it 3 times, understood the recursion tree
watched it literally 5 times, understood everything
worth watching 1 video for 1 hour and understanding everything rather than skipping ahead of the playlist with bits and pieces because then it gets even more confusing!

thank you Abdul Bari for extending a hand to me for free to enjoy math :)

swafly

I'm so lucky that I found this amazing channel....
Thanks a lot sir 🙏

sauravkumar

Applaud for this man!! Great teaching sir.

gauravyadav

in the recursion tree section, I think that the total number of time is N*(K+1) as there are K+1 steps each taking N time. Which would prove why we got n+nlogn in the subsitution method

kageotoko

King of Algorithm education on YouTube. 🙏🙏🙏

RiaziMohandesi

2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3

2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3

2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2

L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm

2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3

2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1

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

L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm

Solved Recurrence - Iterative Substitution (Plug-and-chug) Method

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

L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm

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

How To Solve Recurrence Relations

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

Solved Recurrence Tree Method

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

L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm

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

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

Recurrence Relation T(n)=2T(n/2)+nlogn | Substitution Method | GATECSE | DAA

Recursion Tree Method

Lec 3.3: T(n) = 2T(n-1) -1 | Recurrence Relation Example 2 | Substitution Method in DAA | DSA

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

2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1