First for 2^2T( 2(n/2^3) ×n/4) +2n we need to multiply 4 × above whole bracket equation then we have the value of 2^3T((n/2^3)× 4n/4) +2n After divided 4n/4 we got n then add n +2n = 3n After that we have the equation 2^3T(n/2^3)+3n
You are life saver sir...🫡 College exam k end time pe aap ki videos he kam aate hai. You are Life saver for all engineering community. Thank you sir.🫡🫡🫡🫡🫡
Hi VARUN SIR ! HOPE YOU ARE DOING GREAT 😃 I have one confusion if = 2 ( 2T (n/4) + n/2 ) + n [ IN THIS STEP HOW YOU HAVE CUTTED THE VALUE 2 OF n/2 and the outer 2 ( i.e. outside the bracket ) = 2^2T ( n/2^2 + n/2 + n) = 2^2T ( n/2^2 + 2n ) HOW IS THIS POSSIBLE BEACAUSE YOU ALREADY CUTTED THE VALUE 2 FROM THE FIRST LINE I HAVE MENTIONED... PLEASE CLEAR OUT THIS DOUBT
Dear teacher, I wish you a happy teacher's day. Thank you for being the guide and for inspiring me to do well in my studies. You are the best teacher HApPy tEaCheR'$ dAy
You are amazing!! Btw it will be great if you could include step count method, tabular method for calculating time complexity of an algorithm and also PRAM algorithms, string matching algorithms too
sir i am facing difficulty in substitution method and iterative method because the method that u use is same as our teacher taught in iterative method . so what is main difference between them can you help me
Love the explanation ❤ No doubt you are a great teacher 🙏🏼 But, Lord knows who edits these videos! Reminding every other minute "subscribing" the channel is so annoying.
2 ( 2T (n/4) + n/2 ) + n [ IN THIS STEP YOU MULTIPLY 2( 2T (n/4) + n/2 ) SO [2^2T(n/4)+2^(n/2)] + n [NOW IN THIS STEP CUTTED THE VALUE OF 2 IN THE FOLLOW EQ 2^(n/2) AND THE FINAL RESULTS OF THE GIVEN STEP IS 2^2T(n/2^2) +n+n => 2^2T(n/2^2) + 2n
By bodmas first solve bracket you have to first multiple 2T by 2 so that it became 2 [4T (n/4) + n] /2 this how it is cut outer 2 by deninometer 2 2 [ 2T (n/4) + n/2] + n 2 [ 4T (n/4) +n ] / 2 + n
![L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm](http://i.ytimg.com/vi/JCX8noGdY7k/mqdefault.jpg)
![L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm](/img/tr.png)
![L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm](http://i.ytimg.com/vi/FBKjvXGGCJM/mqdefault.jpg)
![L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm](http://i.ytimg.com/vi/zeVYepdQ9lY/mqdefault.jpg)
![L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm](/img/n.gif)
This channel needs more recognition and reach! Amazing work!
Hi
sir u made a mistake on 3:39 when 2^2 is cancel by 2 how it is still 2^2 i mean the ans should be 2 just........................
bro multiply 2 with bracket... you will get 4T(T/4)+2n/2 and in next step take 4 as 2^2... got it..!!!
Thanks bhai@@xenonudaykhandare2836
Bro you all are so dumb , 1st class child can understand that
@@xenonudaykhandare2836 thanks for solving this
First for 2^2T( 2(n/2^3) ×n/4) +2n
we need to multiply 4 × above whole bracket equation then we have the value of 2^3T((n/2^3)× 4n/4) +2n
After divided 4n/4 we got n then add n +2n = 3n
After that we have the equation
2^3T(n/2^3)+3n
Code with Ayush
honestly my savior , you're the best fam , you always keep things simple. love your videos keep doing 'em
Thanks sir,
Aaj me phone leke gaya tha Exam hall me aur ye question aagaya 😂
Course: B.E (IT Branch)
Lecture successfully completed on 19/01/2025 🔥🔥
love you sir, The way of your explanation is too good
god bless you sir...most useful one!!!
Awesome explanation! You just gained another subscriber!
Owsm sir...keep doing this we extremely need this❣
Bhai Allah aapku himmat de 6 lakh sus.but 8 hours views only 800 ❤️❤️❤️
Sir bhot Bdhya samjhaya aapne
Glad that I found this channel before time.
Nah man U deserve love. really grateful my frnd u just made it simple
You are life saver sir...🫡 College exam k end time pe aap ki videos he kam aate hai. You are Life saver for all engineering community. Thank you sir.🫡🫡🫡🫡🫡
Hi VARUN SIR !
HOPE YOU ARE DOING GREAT 😃
I have one confusion if
= 2 ( 2T (n/4) + n/2 ) + n [ IN THIS STEP HOW YOU HAVE CUTTED THE VALUE 2 OF n/2 and the outer 2 ( i.e. outside the bracket )
= 2^2T ( n/2^2 + n/2 + n)
= 2^2T ( n/2^2 + 2n )
HOW IS THIS POSSIBLE BEACAUSE YOU ALREADY CUTTED THE VALUE 2 FROM THE FIRST LINE I HAVE MENTIONED... PLEASE CLEAR OUT THIS DOUBT
He did Right check you again , he just multiply 2*n/2 and here 2 is cancle out
same ques
the first 2 is multiplied individually inside the bracket. [ 2(2T(n/4)) ] + [ 2*n/2 ]
Bhai mereko bhi ye doubt hua tha. Dobara uss line ka calculation karo individually. Hojaeyga.
I also had this doubt
Dear teacher,
I wish you a happy teacher's day. Thank you for being the guide and for inspiring me to do well in my studies. You are the best teacher
HApPy tEaCheR'$ dAy
Very well explained. Mujhe yeh video lagatar 3 baar dekhne pada par mera concept clear ho gaaya. Thank you very much sir!
So what is the difference between iterative and substitution method in this qtn sir?
Great Explanation 😊😊
Keep it up ❤️💙
Sir good work 👏.
Achi Tara samajh ahi ha..
Srji apney college ke prof se zyada toh idhar acha samajh aa rha hai ... koi bhi stepwise explain nahi karta itna clearly kahi bhi
Beta Dil se padhate he iss liye padho padho
Sir congratulations to complete 6lakh subscriber
Sir how we cancel outer 2 with inner n/2 in 1st two equ's substitution. Coz outer 2 multiplied by all values.
Same question sir
2 is cancelled in multiplication with n/2 not in overall bracket after being multiplied by 2T(n/4).
Same question plz sir
you first do 2 x 2T(n/4) making it 2^2 T(n/4) then we do 2 x (n/2) which cancels 2.
@@parthbatta7968 thanks!
You are amazing!! Btw it will be great if you could include step count method, tabular method for calculating time complexity of an algorithm and also PRAM algorithms, string matching algorithms too
The way sir says subscribe bahut zaroori hai
Hits hard more than time complexity 2 ki power n
Sir your explanation and you both are outstanding
you're taking it in complicated way my college teacher explains it in very simple and easy way
Congo sir 600k
Love from pak ❤️
sir just a doubt , why do we always take log both side always , i never understood this , 7:29 plz reply fast ...
sir i am facing difficulty in substitution method and iterative method because the method that u use is same as our teacher taught in iterative method . so what is main difference between them can you help me
Sir guide and help my DAA Paper is on monday 14 april
Every one make sure u like every one of sir's vdo other wise u will forget this in ur exam
Sir, English version of your Lectures. Very great content ❤❤❤❤❤❤❤❤❤❤❤❤❤❤
you are very very very good teacher 😊and looking like 😍😎❤
Thank you so much sir 💗☺️
Happy Teacher's day sir
🙏✨💫
Sir you are an absolute legend
Best Teacher ever.
Acha smjate ho🔥
Love the explanation ❤ No doubt you are a great teacher 🙏🏼
But, Lord knows who edits these videos! Reminding every other minute "subscribing" the channel is so annoying.
Awesome explanation
Hello Sir, Answer is T(n)=n+nlogn then how it become O(nlogn). It should be Ω(nlogn), isnt'it?
We are multiply by 2 on both equation sir ne jo karaya hai vo sahi h
how 2^2T is possible if you cut n/2 by outside 2 then their is only one 2 is left. If you multiply both then 2^2 is ok but you cut it.
Sir ye iteration method h ya substitution kyuki mko ye iteration bataya gaya h
Sir muzhe mathematical induction and recursion ka lec chaiye tha ..video send kro na ap
In 3:28 if we write 2 square there, then how can we cancel the above 2 with 2 in n/2 in 3:37
can we apply the Master Theorem to analyze the recurrence relation?
T(n)=2T(n/2)+n I am getting trouble, Please help
Insane so good❤
Needs more explanation step wise solution
I couldn't understand where what we assumed or guessed to solve it
Sir computer vacancy ke preparation hoge kya
Missing the old board😌
i have a doubt :
on 3rd line of answer we eliminated the outside 2 with n/2 then how come on fourth line we have 2^2
I think there is some mistake in the solution..if you are cancelling outer 2 with n/2 then how again you got that 2^2 ?
sir aap hi engg ki naiyaa paar lagaoge 🤩
hats of ustad g 🫡💯
Great sr
if you made these videos in english, it will be a great help to south indians who doesnt understand hindi.
Thanku sir❣️
sir pls explain recurrence relation by iteration of second order equation
HAPPY TEACHERS DAY SIR!
there is a mistake in the step where you cut 2*2 by 4
2 ( 2T (n/4) + n/2 ) + n [ IN THIS STEP YOU MULTIPLY 2( 2T (n/4) + n/2 ) SO [2^2T(n/4)+2^(n/2)] + n [NOW IN THIS STEP CUTTED THE VALUE OF 2 IN THE FOLLOW EQ 2^(n/2) AND THE FINAL RESULTS OF THE GIVEN STEP IS 2^2T(n/2^2) +n+n => 2^2T(n/2^2) + 2n
2 ki multiple kar di andar n se toh 2n upon 2 hogya fir 2 cancel hogya bacha n +n
LORD SPOTTED 🛐🗿
if i do this same question using Master method then the answer is O(n) . why ?
Because u done mistake
Sir please do videos in english also 🙏
Thank you sir
This relation is of which sort technique?
Sir please upload AI and ML playlist
Please 🙏🙏🙏
Can we call this as iteration method??
How can i solve T(n)=T(n/4)+T(n/2)+n² using recursion tree method
ye n/2k kaise =1 daal skte ho marzi se
2 ke power me squre kese aya ?
1:00 aur device is suscribe kara doo...Chad moment 😎😂
How can u divide 2 and n/2
Sir agar n ke badle cn raha ga to kuch change ho ga kya
Tq so much sir
there's a mistake, where's the extra 2 coming from
Finally digital board😌
2 square kaise aaya?
2-way Merge Sort ka recursive equation
Sir can you please make a video on following equation. 8T(n/2)+n^2 here T(1)=1. Plz sir after 15 days I have exams and this question is important 🙏
Bhai n/2 karke solve karta chala ja aa jayega
15 din me ek question toh khud se solve kar le bhai ab toh 1 sal ho gye hue kya??
Sir log ki base u hi nai ati es ye ati ha jab log n ko log 2 se divide krtey han tab ati ha Verna normally 10 hi hoti ha😁🤪
Sir 2 square kahna se aya uspe
yra equation kay numbers peh circle to karo sara time us peh stuck rha
bhai shuru ki beat ka link bhej de, rap karna hai uspe
Where did T go in 4th step
yeh 2 square or 2 cube khn se aarha hy?
Is this Iteration Method?
Yr batao yeh iteration ha I am also confuse
And where didn T go
can anyone plese tell where these n^2 and n^3 are coming from plz
sir 2 ko bracket open kr ke 2t se multiply kr raha ha fir n\2 se usko cancel kasa kr raha ho
By bodmas first solve bracket you have to first multiple 2T by 2 so that it became 2 [4T (n/4) + n] /2 this how it is cut outer 2 by deninometer 2
2 [ 2T (n/4) + n/2] + n
2 [ 4T (n/4) +n ] / 2 + n
that was the time complexity for merge sort
sir 2 sqaure kaise hua isme
2 already tha ak or 2 aya isliye
By solving this question you did back substitution method wrong check it once.
For k time it become T(n/2^k + kn) 🧠
Best
I wish there is english subtitles for this sir :(
There are...
if anyone can solve it for T(n) = T (n/2) + n. It would be great.
3:13
❤🔥