2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1

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

Recurrence Relation for Decreasing Function
Example : T(n)= T(n-1) +1

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

Рекомендации по теме

Комментарии

I love how he sometimes pauses and looks at the camera after he explains something and it feels like he's saying "how did you not understand this shit, idiot"

louai

Him: *Looks at the camera*
Us: Write that down! Write that down!

jamesward

Sir, I must say, you are amazing. I have never seen any person before you, who teaches alogs with that simplicity and understandable. Even IIT lectures are very poor and look like book writing. You should create more videos. It's a big request.

hardeepsingh

I like the way you present things, especially the pauses you make everytime after you've explained something. That way, one can think about what you said for a second and then move on, which helps a lot in understandig it. Thank you for your great work sir, it is very appreciated!

kozert

This man is the real MVP for my algorithm classes. Thank you sir!!

patrickschnurbusch

I've had the privilege to attend his lectures live! I enrolled into GATE coaching in Bangalore where the classes were held on weekends. On Saturdays, I used to bunk my last hour at college and catch a bus which used to take around 1hr to reach the destination(Saturday classes used to begin at 2pm). Easily one of the best lecturers I have come across!

srikantam

I remember struggling during my algorithm class as well as exam not understanding these topics. Thanks a ton for existing and making videos sir. You just made my life better.

candicerusser

Greetings from Turkey... Sir, your english is comprehensible. I have been watching your lectures for 5 months. You helped me to save my time during PhD proficiency exam. Thank you so much.

yunuskorkmaz

Him: "Then [...], alright?" [*looks at the camera and waits]
Us: *nodding back

anastasiagavrilita

It’s not the subject that’s hard, it’s the professor who makes it complicated. Loved your teaching style, straightforward, yet mature way! Thanks a lot.

rohanrajaggarwal

I really like how calm he is. It somehow helps when trying to learn.

tyrtz

I took an NPTEL course. It didn't help. Now I'm here to learn from you, sir. Your teaching is far better than any instructor out there. Thanks a lot sir!

mananvarma

sir I m m from non mathematics always struggled to calculate complexities of I hv hope that I can learn it esily, following ur videos

JitendraYadav-orid

I have taken more than 5 min to think about what I need to write in the comment. I found no words, I must say before watching your videos I was scared from Maths now I'm feeling confident about what I need to do. I'm doing a Ph.D. from the United Kingdom. I had to write the algorithm for my research work and after watching your videos I know I can do it now. I don't have words to express to thank you. Big Salute Sir :)

pankajgoikar

This guy is AMAZING at explaining things. I've been doing computer science for a long time and I'm seriously impressed with his videos. I see in the comments that some of you are here like ... the day before an exam. Well, as far as I can tell... this is your best bet. If you can' t get it from here then good luck XD

jeremygamet

I am taking an algorithm course now. I didn't attend any lesson after the second one by the reason of being boring. I am reading from the book and when I have a question, I watch these video materials. They are amazing. Thank you!

muradhajiyev

sir, we're spending thousands of dollars in an international university, and your teaching standards are far better than the shitty professors we have here, thank you sir, much appreciated!

gurashishanand

your teaching style is absolutely stunning. The amount of patience this man has is on another level

johnnynguyen

That was really good, I like how you didn’t mention buzzwords like “proof by induction” and just walked us through step by step to help us recognize proof by induction

solstice

Hi Im a first year CS student doing my bachelors in university and I have to say you sir, are better than any of the teachers Ive met in my life. I am a fan!

af

2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1

2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1

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

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

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

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

Recurrence relation T(n) = T(n-1) + 1 || Algorithms & DataStructures

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

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

Recurrence Relation T(n)= 4T(n/2) + n^2 ⚡Characteristics Method⚡Changing variable⚡Algorithm 🔥DAA...

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

Lec 3.9: Recursive Tree Method | Example 4 | T(n) = 2T(n-1) + 1 | Recurrence Relation in DAA

Recurrence Relation Examples | T(n) = 2*T(n-1)+1 and T(n) = T(n-1)+n by Forward Substitution | DAA

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

How To Solve Recurrence Relations

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

Recurrence Relation T(n) = T(n-1) + C | Substitution Method | Finding Factorial | GATECSE | DAA

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

2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3

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

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

Solve Recurrence Relation using Backward Substitution Method | T(n) = T(n+1) + n | DAA | Mathematics

T(n-1) + n SOLUTION | TREE METHOD | RECURRENCE RELATION EXAMPLE

2.2 T(n) = n+ T(n-1) by Substitution method || DAA

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