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

preview_player
Показать описание
#recurrencerelation, #gatecse, #daa, #thegatehub
Contact Datils (You can follow me at)

Watch Complete Playlists:
  1. THE GATEHUB
  2. t(n)=2t(n/2) nlogn
  3. t(n)=2t(n/2) nlogn substitution method
  4. t(n)=2t(n/2) nlogn master theorem
  5. t(n)=2t(n/2) nlogn recursion tree
  6. t(n)=2t(n/4) sqrt(n) master theorem
Рекомендации по теме
Recurrence Relation T(n)=2T(n/2)+nlogn 0:14:12

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

Recurrence Relation T(n)=2T(n/2)+n/logn 0:11:20

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

How to solve 0:02:46

How to solve recurrence T(n) = 2T(n/2) + n/log(n) using substitution method?

L-2.4: Recurrence Relation 0:08:57

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

Recurrence Relation [ 0:07:00

Recurrence Relation [ T(n)= 2T(n/2) + nlogn ] | Master Theorem | Example#2 | Algorithm

Master theorem for 0:01:48

Master theorem for $T(n) = 2T(n/2) + n^{2}log n$

T(n)= 2 T(n/2) 0:08:26

T(n)= 2 T(n/2) + n/logn. Recurrence iteration method

Recurrence Relation T(n)=2T(√n)+log 0:09:33

Recurrence Relation T(n)=2T(√n)+log n | Substitution Method | GATECSE | DAA

Solve this Recurrence 0:15:02

Solve this Recurrence Equation (using back substitution): T(n)= 2T(n/2)+log_e(n)​ given T(1)=1

Recurrence Relation T(n)=2T(n/2)+n 0:05:24

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

Solve the given 0:04:05

Solve the given Recurrence relation by Master Theorem T(n)= 2 T(n/2) +n/logn | Case 2.2

Computer Science: Solution 0:01:29

Computer Science: Solution to T(n) = 2T(n/2) + log n

Recurrence Relations T(n)=T(√n)+logn 0:06:56

Recurrence Relations T(n)=T(√n)+logn Using Master's Theorem || GATECSE || DAA

$T(n)=2T(n/2)+nlog n$ and 0:01:52

$T(n)=2T(n/2)+nlog n$ and the Master theorem (2 Solutions!!)

L-2.9: Recurrence Relation 0:07:14

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

MASTER RECURRENCE RELATION 0:17:26

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

Solve using Masters 0:03:11

Solve using Masters Theorem (Dividing Function) T(n)=2T(n/2)+n^2 (log n) | MUTHU KUMAR K

L-2.2: Recurrence Relation 0:05:38

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

L-2.8: Recurrence Relation 0:06:26

L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem

Masters Theorem with 0:25:54

Masters Theorem with Example

Mathematics: How to 0:03:12

Mathematics: How to solve this recurrence $T(n) = 2T(n/2) + nlog n$? (2 Solutions!!)

2.1.4 Recurrence Relation 0:10:42

2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4

Recurrence Relation T(n)= 0:07:07

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

Solving the recurrence 0:02:31

Solving the recurrence relation T(n) = 2T(n/2) + nlog n via summation

Комментарии
Автор

this channel deserves more views....excellent explaining and u r doing a lot videos on variety of problems which is helping me alot 💚

NSHAIKKHADARBEE
Автор

no youtube channel provides with such type of explanation and these many question .thanks for helping me a lot

ashakiranpratihari
Автор

Your way of teaching is really good. Very Underrated. I've completed TOC and compiler design playlists from your channel. Great work sir!

Rits
Автор

bhai sidhi baat hai subscribers kam hai. ye sir is se kai zyada deserve krte hai. kya mast sikhaya hai yar.... maza aagya sir
thank you sir

Emperor
Автор

Bom vídeo, estava difícil encontrar esse exercício. Mas uma coisa, o resultado ficou incorreto quando tirou o denominador 2, fiz a prova por indução sem retirá-lo e estava correto. Só de fazer o teste para n=2 já dá para perceber que está errado. Fiquei um tempo tentando entender isso antes de testar, então é um aviso para quem ficou com a mesma dúvida.

Duda-kfpd
Автор

wait, i understand the sum of natural number to log(n) but there is substraction too?? for each term of log containing n?
why are we just ignoring that?

swopnilmaharjan
Автор

نحن بحاجة الي معلمين متلك بجامعتنا والله 😞

زَهْرةالأقُحُوان-نتغ
Автор

Badhiya ji baki sab to thek hai but jo marker ka sound hai wo bahut bekar lag rha tha or disturb bhe kar raha tha

yrkkhcreationworld
Автор

thankyou so much such clear explanation GOD bless you

uroobashahid
Автор

That was really helpful sir . Thank you

mssiah
Автор

is question ko master theorem se bhi solve karien

moonthoughts
Автор

sir you look like Dino james
nice explanation

abhinavprakash
Автор

Is there any difference between Substitution Method and Iteration Method

tanmoybera
Автор

Why at the final part the denominator 2 is cancelled?

mastershifu
Автор

agr isko master theorem sy kryn tu b Big O k sath he aye ga ans ya phr Theta k sath?

barkasafeer
Автор

please solve this question using substitution method.
12T(n/2)+1/5n^3
please solve this one

LARAIBFATIMA-qein
Автор

Is there no condition that n must be powers of 2?

jbm
Автор

This Is a bit wrong from 2:12 when we will multiply n/4 it'll be multiply with 1/4 not 1/2 will be T(n/16) At third Not T(n/8)

mmusic.