I've been following you for almost a year now. It's been really helpful throughout. I've suggested your videos to other students as well. Thank you for wrapping up the whole idea in a few minutes clearly.
Whenever im free , i put on his video on youtube but i dont watch it, so that he gets the views and ads for doing such a great work for free :) @Gate Smashers
Do we need to necessarily bring down the constant while calculating the U(n) ? (The one which we multiplied with logn) Because through the table only the logarithm part is said to be considered
In a very short time u became my hero in all the teachers. Please keep teaching sir very soon you will become the best teacher. I really appreciate and very much impressed with your knowledge sir. Not only this subject u cover every part of DAA, CAO, Electronics which were burden of yesterday, you made it all crystal clear
The running time of an algorithm T(n), where ‗n‘ is the input size, is given by- T (n) = T(n/2)+ logn, if n > 1 = p, if n = 1 where p, q are constants. The order of this algorithm is- (a) n2(b) loglogn (c) logn (d) (logn)2 i am getting loglogn as answer on this problem sir.
hello sir, can you please explain this question The running time of an algorithm T(n), where ‗n‘ is the input size, is given by- T (n) = T(n-1)+ 1, if n > 1 = p, if n = 1 where p, q are constants. The order of this algorithm is-
T(n)= 8T(n/2) + (n^3/ log^2 n) sir for this question your method does not work h(n) is does not have category for to get u(n) T(n)=4T(n/2) + (n^2/ log n) same for this question
The running time of an algorithm T(n), where ‗n‘ is the input size, is given by- T (n) = 8T(n/2)+ qn, if n > 1 = p, if n = 1 where p, q are constants. The order of this algorithm is- (a) n 2 (b) n n (c) n 3 (d) n Solution: Option (c) Sir, how it is n^3 ? I got n as an answer. Please explain..
sir what if we get h(n) = (log n)^-1 then it will go in which case??? the question was T(n)=4T(n/2) + n^2/log n kindly answer this sir, your method is very effective but I cant get this question @Gate Smashers
Hi sir your videos are most interactive and easy to understand I have one query regarding the question 3 in the document provided in the link. If I calculate it is resulting me 8T(n/2)+qn = n, but the correct option in the sheet provided as n^3 could you please, explain this problem.
Tq so so much sir. This video is very useful.... sir can u pl make d videos on imp topics, tricks and tips for questions on algorithms considering nic -nileit exam
Sir , would U pls attach answers for the qns using substitution method . Using master method it's easy to solve but using substitution method I am not getting ans . If any one solved using substitution method for the practice qns pls .... provide ans document
sir apny practice question prov kye hen mujy smj nhi arha h k kis question ko substitute waaly or kis ko master theorem sy solve krna h. mujy bataen k hmen kesy pata chalega plzz
![L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm](http://i.ytimg.com/vi/icS-e8RaCyo/mqdefault.jpg)
Where is the link for questions?
I've been following you for almost a year now. It's been really helpful throughout. I've suggested your videos to other students as well. Thank you for wrapping up the whole idea in a few minutes clearly.
Whenever im free , i put on his video on youtube but i dont watch it, so that he gets the views and ads for doing such a great work for free :) @Gate Smashers
Wow.. Thank you so much
One gmail account gives only one view no matter how many times you see
@@hemanthsaimadala4135not now
@@hemanthsaimadala4135perhaps viewed hours are counted
@@hemanthsaimadala4135To ek hi vid thodi dektha hoga sari dekhta hog na bhi.... akela admi aur kya kre 😅😅😅😅
Do we need to necessarily bring down the constant while calculating the U(n) ?
(The one which we multiplied with logn)
Because through the table only the logarithm part is said to be considered
In a very short time u became my hero in all the teachers. Please keep teaching sir very soon you will become the best teacher. I really appreciate and very much impressed with your knowledge sir. Not only this subject u cover every part of DAA, CAO, Electronics which were burden of yesterday, you made it all crystal clear
After roaming everywhere, I saw this video, understood here in the best way, its amazing 💯💯
sir i really appreciate your efforts and your teaching skills. i have a request could you please make videos on iteration and recursion tree method?
Soon we will upload...
Such an amazing Master theorem explanation! Literally the best on the internet! Thanks a lot for this @Gate Smashers ❤
3:52 great explanation!
thanks a lot ❤
Jahapna tusi great ho... Toufa Kabul kro🙏🏻🙏🏻
The running time of an algorithm T(n), where ‗n‘ is the input size, is given by-
T (n) = T(n/2)+ logn, if n > 1 = p, if n = 1
where p, q are constants. The order of this algorithm is-
(a) n2(b) loglogn
(c) logn (d) (logn)2
i am getting loglogn as answer on this problem sir.
(Logn)^2
@@JaskaranSingh-hw5jf correct
@@nirajvarma-z7d abb to bhulgya sab
Is it always the case that we get the log to the base 2 in the third case for U(n)?
you are hope of many engineers 😊
thanks u sooo much ,wasa utube pa jldy kisi ki samj ni ati pr apka lectures ki samj ati ha .Great skills
Where is the Question File?
I couldn't find it in the description box..
Thank you for the amazing lectures sir❤
4th sem?
The video was really good and helpful. Thank you for the practice questions!
I cannot find the practice questions. Can you please share the link?
Thanks Sir It helped me after 1 year of upload and helpful to others too. 😊😊
Thank You For practice questions 😃!!
hello sir, can you please explain this question
The running time of an algorithm T(n), where ‗n‘ is the input size, is given by-
T (n) = T(n-1)+ 1, if n > 1 = p, if n = 1
where p, q are constants. The order of this algorithm is-
try back substitution. Master's Theorem is invalid for this question.
where is the link for question???
brilliantly explained ... just 2 hours ago before viewing this series, I knew nothing and now I can say i know significant stuffs... thanks a lot ..
T(n)= 8T(n/2) + (n^3/ log^2 n) sir for this question your method does not work h(n) is does not have category for to get u(n)
T(n)=4T(n/2) + (n^2/ log n) same for this question
Bro convert first then apply the solution
For 1st one is n^3
And for second n^2
One of best videos
i ever seen sir. Thank you so much sir. waiting for more videos related to gate exam ?
Thank you Sir . outstanding explanation.
short and easily explained ...thanks a lot
SIR YOUR CONTENT IS VERY LESS BUT ITS EFFICIENT IN MAY TIMES
Sir if there will be log in f(n) then how to solve that by this table for example T(n) =2T(n/2)+n/(log^2n)
you're great sir !!! what amazing tricks you have for studies, big fan sir
I can't find the link to the file where more problem questions are given. can you reply me with the link in comment?
Sir daa ki series aage bhi bnao pls,, aapne bohat kam topics cover kiye h, jo sufficient nhi h slabus point of view se gate k... Nice video
great teaching skills!! on the point video!! really appreciate your efforts!!
Well explained sir!!thnku
The running time of an algorithm T(n), where ‗n‘ is the input size, is given by-
T (n) = 8T(n/2)+ qn, if n > 1 = p, if n = 1
where p, q are constants. The order of this algorithm is-
(a) n 2 (b) n n
(c) n 3 (d) n
Solution: Option (c)
Sir, how it is n^3 ? I got n as an answer. Please explain..
Log a to the base b will be 3.. so it will be n3 .. and U(n) will come as O(1)
Thank you so much for the practice questions .. love you sir ..
u can share with me those practise questions
thank you sirji for the questions also, got'em all.
sir if log(base2)power(n) = nlog2 = O(n)
then why we put it O(log2N) atlast
where is practice questions ??
Hii sir can you tell me when you put value of a and b 8 and 2 respectively in log equation then how we get n(cube)
Boht badiya. Thank you so much.
Thank you for the practice problems sir..:)
This tutorial is very helpful and it is explained in very good manner .
Thnks bhai/sir
sir what if we get h(n) = (log n)^-1 then it will go in which case???
the question was T(n)=4T(n/2) + n^2/log n
kindly answer this sir, your method is very effective but I cant get this question
@Gate Smashers
I solved the questions in the doc given in description & got all 7 correct 😉
last question m n(logn)^2 kaisa aya ?? i got n +(log n)^2 as answer so where did the n come from in answer??
can u plz provide docs link
Are you sure there is a doc?
Bhai doc kha hai ye bhi bata de...
Thankyou so much sir, for your great efforts.
Hi sir your videos are most interactive and easy to understand I have one query regarding the question 3 in the document provided in the link. If I calculate it is resulting me 8T(n/2)+qn = n, but the correct option in the sheet provided as n^3 could you please, explain this problem.
Thank you sir for all the questions you provided. It helped me so much for my exams.
crystal clear concept explanation.
gjb gjb gjb....... superb sir.......
Sir, Can we get the answers uploaded for the practise questions you have shared so that i can verify the steps followed are right or wrong?
Where is the link please share here i didn't get it
sir where is the link for the file where the questions recurrence relation are given ?
Excellently explain...
Excellent commitment.
3:43 bhaiya file kaha milega?
Thank you for giving practice questions.
Ab sabke Gate SMASH kar dunga!
Kidhar hain ? Nehi mil raha description box par
Thank you for the material of questions
where is material?
Sir agar h(n) jo hain 1/log n hain toh kya karenge, U(n) ke liye please explain sir???
Same doubt. .
If u know then please reply me. ..!
Sir, practice questions are no longer available there...
+1
Tnx sir👍❤️
Really great sir.
wowww amazing lecture
Thank you sir for the questions
Thanks and welcome
Tq so so much sir. This video is very useful.... sir can u pl make d videos on imp topics, tricks and tips for questions on algorithms considering nic -nileit exam
Sir gate exam ke liye master theorm par jyada focus kre ya substitution method par recurrence relation mein??
Sir i don't know how to solve log question.............means what is value for nlog33
Please Discuss/ Explain Recursion Tree Problem also
Where can i find the notes?? Can anyone help i can't find those notes of unsolved questions
Sir , would U pls attach answers for the qns using substitution method . Using master method it's easy to solve but using substitution method I am not getting ans .
If any one solved using substitution method for the practice qns pls .... provide ans document
QUESTIONS IS WHERE CAN YOU SEND ME THE LINK ?
Thanks sir for the great video, practice questions really help.
Where is the link??
Sir it's not working on 5T(n/4) + n^2,
👍 Thank you sir!
all great videos sir
practice set , and pdf ,,,It's very helpful
Thank you sir
Sir please provide gate previous year question and discuss this question...
thank you sir..:)
how to find "i" value
@Debasree Rocz thanks
Sir, is this another method of master's theorem?
If sir H(n) =2^n then what will be the value of U(n)?
Did you find any answer to this? Or does this method doesn't work for this
Thank you sir..for the PDF..😊
Kha mili pdf
@@vaishnavihingnekar1986 PDF is in the description..☺️
@@vaishnavihingnekar1986 I think you got it..👍
sir wheres the link for extra questions
So beautiful sir.From Bangladesh.
sir apny practice question prov kye hen mujy smj nhi arha h k kis question ko substitute waaly or kis ko master theorem sy solve krna h.
mujy bataen k hmen kesy pata chalega plzz
How did the value of i=0 ? please you didn't explain it.
Great
Sir i have a question..
if my eq is t(n) = 8T(n/2)+3n^2 how should i solve it
Thank you sir...
Sir i have a ques can please explain it
T(n) = 2T(√n) + logn
Did you got the answer? I too have the same query.
did you find the solution ?
if yes, how can we do that ??
Sir i ki value kaise put ki aapne
no materials in description box
Sir what about master theorem for substract and conquer... Please upload sir
Can you please solve T(n) = 2T(n/2) + nlogn using the same concept ?
Did you find any answer to this??
Sir, Is this method applicable to decreasing functions also? for example t(n) = 2T(n-2) + n
No, bcz b should greater then 1
h(n) log base 2 n
Right?
Sir ye table kaise ata hai?
Thankyou sir
thankyou sir
In the first question of the pdf the answer comes out to be O(n log n). But its given as O(n). Can u please explain.
Sir third case visible ni hoparahq
Where is the file link ?
please upload solution of practice questions,
where are the practice question bro
kindly solve the recurrence relation t(n)=t(3n/4)+1
o(logn)
There s a table of h(n) and u(n) ....from there what s " i " ?