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

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

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
  1. Gate Smashers
  2. recurrence relation
  3. algorithm
  4. algorithms
  5. substitution method
  6. master theorem
Рекомендации по теме
L-2.4: Recurrence Relation 0:08:57

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

2.1.4 Recurrence Relation 0:10:42

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

L-2.10: Recurrence Relation 0:09:31

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

L-2.9: Recurrence Relation 0:07:14

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

L-2.3: Recurrence Relation 0:07:40

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

L-2.2: Recurrence Relation 0:05:38

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

L-2.6: Recurrence Relation 0:06:34

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

Solved Recurrence - 0:09:08

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

L-2.7: Recurrence Relation 0:03:58

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

2.3.3 Recurrence Relation 0:11:20

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

Recurrence Relation T(n)= 0:11:20

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

2.3.2 Recurrence Relation 0:07:26

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

How To Solve 0:16:21

How To Solve Recurrence Relations

2.3.1 Recurrence Relation 0:08:41

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

L-2.5: Recurrence Relation 0:10:23

L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm

Recurrence Relation [ 0:09:41

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

L-2.1: What is 0:07:15

L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

Recurrence Relationship Unrolling 0:05:11

Recurrence Relationship Unrolling T(1)=1 T(N) = 1 + T(N/2)

Recursive Formulas For 0:02:54

Recursive Formulas For Sequences

Recurrence Relation T(n)= 0:09:22

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

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

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

Recursion tree method 0:14:15

Recursion tree method | Solving Recurrences | Data Structure & Algorithm | Gate Applied Course

Write Recursive Formulas 0:07:18

Write Recursive Formulas for Sequences (2 Methods)

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

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

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

This channel needs more recognition and reach! Amazing work!

khushigandhi
Автор

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

Smartcity
Автор

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

nabilmalik
Автор

Srji apney college ke prof se zyada toh idhar acha samajh aa rha hai ... koi bhi stepwise explain nahi karta itna clearly kahi bhi

akashpb
Автор

Thanks sir,
Aaj me phone leke gaya tha Exam hall me aur ye question aagaya 😂
Course: B.E (IT Branch)

devpatel
Автор

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

AroojArmy
Автор

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.🫡🫡🫡🫡🫡

silverfanggaming
Автор

Sir congratulations to complete 6lakh subscriber

amitgoswami
Автор

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

-subhannitasaha
Автор

Bhai Allah aapku himmat de 6 lakh sus.but 8 hours views only 800 ❤️❤️❤️

aamirdehngal
Автор

honestly my savior, you're the best fam, you always keep things simple. love your videos keep doing 'em <3

akshayavbca
Автор

Very well explained. Mujhe yeh video lagatar 3 baar dekhne pada par mera concept clear ho gaaya. Thank you very much sir!

empathetic
Автор

love you sir, The way of your explanation is too good

mdtalhashaikh
Автор

So what is the difference between iterative and substitution method in this qtn sir?

romanasalim
Автор

Owsm sir...keep doing this we extremely need this❣

DineshSingh-hxkw
Автор

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.

moonedCake
Автор

god bless you sir...most useful one!!!

SAKSHIKUMARIP
Автор

Sir bhot Bdhya samjhaya aapne
Glad that I found this channel before time.

amaanullah
Автор

you're taking it in complicated way my college teacher explains it in very simple and easy way

ShifaAnjum-fh
Автор

The way sir says subscribe bahut zaroori hai
Hits hard more than time complexity 2 ki power n

dressbydeen