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

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

Recurrence Relation for Dividing Function
Example : T(n) = T(n/2) +1

explained using Recursion Tree and Back Substitution Method

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

Data Structures using C and C++

C++ Programming

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

Комментарии

Thank you sir for reducing my time complexity of understanding time complexity !

amruteshmishra

You are absolutely amazing! For so long, I never understood how to do anything related to analysis of algorithms, but now I understand! Thank you so much for spending time with us to teach me what other professors have failed to do.

LcaptainoftheForsaken

The way he teaches is so relatable, no hidden magic, he unfolds everything

victoryosikwemhe

Wow, I loved the way I paused the video and did the substitution method and as well as tree method. Your way of teaching, making it easier and easier for all of us. Thank you so much, Sir.

asishraz

Wow ! Nobody would have explained better ! Thank you sir ! Hope you make more videos !

akashkirthik

Thanks Prof. you are doing awesome job, the way you explain the algorithms, may God bless you

tallalomar

The way you explaining sir is just awesome..cleared all my doubts..Thank you very much sir.

manaskundu

@abdul bari, U are doing a great job sir

urbanpendu

Thank you, sir, your videos are very helpful for me, I have seen many videos but now to see your videos my doubt is clear and understood the time complexity.

AmitKumar-hhde

This is such an amazing simple explanation. Thankyouuu!! 😊😇

hereforthecultstuff

You are my Yoda of the computer science force

TheBardack

Thank you sir for helping me understand this difficult subject of Algorithms in a simpler, digestable way :)

sriyapatturi

hello sir u are my Idol,
we students will never gets an teacher like you .
you are Gr8 sir , I am personally Very Big fan of u . if any Moment of life I want to meet you .

I competed your DS course on Udemy on limited period of time & Begin with algorithm course .

Sirr One and only last request from you if possible, plz make an DSA problems Sheet with link of your solving Ans & give Related Question As HomeWork .
THen Onwards yours course is fully completed And we students Gets fully Prepared for Product Based Company.

if the DSA sheet is created By [ Abdul Bari sir. ], I Gaurented all your Lovingly Students gets Happy and Thankuable for ur Favour.

Thank You Very Much Sir. 🤗

it_rajat_parate

You are Pro now master theorem look obivious

😍

JourneysAndInsight

Sir thank you for sharing this video...sir can you put video for
1. T(n)=T(n/2)+1. Where n=2↑k for all k greater than or equal to 0...
2. T(n/3)+T(2n+3)+cn. Where c is constant & n is input size... please sir help me...

prajan_jana

I love your accent, kisses from Brazil!!

oTalDoAmaral_XD

Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝

vakhariyajay

Hats of to you sir awesome explanation .

subramaniyanvg

The textbook I am reading skipped so much material that it is also impossible to figure out without a good explanation. This wa sexcellent.

shaneyaw

You are the best thank You for This super course

mohamemdtalbi

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

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

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

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

How To Solve Recurrence Relations

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

Master Method for Solving Recurrences (Dividing Function Example video)

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

What is the Master Theorem?

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

2.4.1 Masters Theorem in Algorithms for Dividing Function #1

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

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

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

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

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

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

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

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

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

2 RECURRENCE SOLUTION

Iteration Method To Solve Recurrence Relation (Data Structure and Algorithms)

Recurrence Relations Problem 1 - Recurrence Relation - Discrete Mathematics

Recursion Tree Method

How REAL Men Integrate Functions