Recurrence Relation T(n)=2T(n/2)+n/logn | 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) n/logn
  3. t(n)=2t(n/2) n/logn substitution method
  4. t(n)=2t(n/2) n/logn master theorem
  5. t(n)=2t(n/2) n/logn recursion tree
  6. t(n)=2t(n/4) sqrt(n) master theorem
Рекомендации по теме
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

Recurrence Relation T(n)=2T(n/2)+nlogn 0:14:12

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

L-2.4: Recurrence Relation 0:08:57

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

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

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

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

Recurrence Relation T(n)=2T(n/2)+n | 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?

2.3.3 Recurrence Relation 0:11:20

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

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

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

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

Solved Recurrence - 0:09:08

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

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

L-2.8: Recurrence Relation 0:06:26

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

2.3.2 Recurrence Relation 0:07:26

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

Lec 3.3: T(n) 0:13:18

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

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

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

L-2.2: Recurrence Relation 0:05:38

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

MASTER RECURRENCE RELATION 0:17:26

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

Recurrence Relation [ 0:07:00

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

Solving Recurrence relation- 0:17:36

Solving Recurrence relation- T(n)=2T(n/2)+1

L-2.9: Recurrence Relation 0:07:14

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

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

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

2.1.4 Recurrence Relation 0:10:42

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

2.1.2 Recurrence Relation 0:16:00

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

Computer Science: Solution 0:01:29

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

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

Even if I dont speak Indian I understood everything. So many thanks..

emirhanpolat
Автор

salam ! T (n) = 2T (n/2) + n/ log n in this Recurrence Relation is master theorm is applicab;le please tell me there is little confusion between it.
there is a non-polynomial difference between f(n) = n / log n and n^log_b(a) = n^log_2(2) = n, as log n is not a constant factor of n. In the Master Theorem, which is applicable for recurrence relations of the form T(n) = aT(n/b) + f(n), the difference between f(n) and n^log_b(a) must be polynomial in order for the Master Theorem to be directly applicable. When the difference is not polynomial, as in the case of T(n) = 2T(n/2) + n / log n, the Master Theorem may not be directly applicable, and other methods may need to be used to solve the recurrence relation. how can we solve this by master theorem please....

muhammadahsann
Автор

Sir, Change of variables topic ke video banaye.

PrabhatSharma-edvg
Автор

The irritating sound of marker is actually spoiling the whole mood😢😢😢😢
Although thanks for the video❤

paigamehaqq
Автор

The video is good but the sound of the marker🤕🤕

AmanDeep-gfew