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

Подписаться 1,9 млн

Просмотров 986 тыс.

50% 1

👉Subscribe to our new channel: / @varunainashots
0:00 - Master Theorem
3:56 - Question
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RU-vid: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com

Опубликовано:

3 июл 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 295

@amg6950 3 года назад

Cheers to this guy for saving us a day before our exam

@jaylu3354 2 года назад

True ⚡👍

@aravindsagar2226 2 года назад

*on the day of exam 😂😂😂🥲

@priyankathapa9679 2 года назад

@Roasterminator ban gaya cool chutiye jese comment karke

@theabhish1 Год назад

@Roasterminator indirectly unhe paise mil rhe hai

@akhakhi1386 Год назад

@@theabhish1 thoda sa milte hai bhai jitna wo kaam kar rha h utna nhi milte

@vishakasaxena5019 Год назад

This is wonderful. Sir how simply you explain everything. My professor explains this topic in such a pathetic manner that i feel like I can never solve any master theorem question. But today I watched your video and everything became so easy. Thank you sir. I'm so grateful to you 🙏

@mayurkalsekar524 4 года назад

Sir you are doing a great work. It's helping many students like us to understand complex topics with ease. Plz do not stop this godly work. Thank you.

@salilshukla2686 4 года назад

Thanks sir for making these videos for us.It takes a lot of effort to make these videos in a busy schedule.

@aditiagarwal2069 3 года назад

Sir you are just too good. You have simplified the concepts so well. Thankyou so much sir.

@ni1836 3 года назад

Literally a life saver!! Cant thank u enough 🙌🏻 THE BEST

@psc_youtuber 3 года назад

That's really a very great kind of explanation.

@preetishpatel2306 2 года назад

@@psc_youtuber you're a fool !

@Priyanshuk143 2 года назад

@@preetishpatel2306 u r nub

@shubhamsukum Год назад

for those who are asking N3 (cube) kaise aaya.... its actually n raise to(log base b a ) that is log base2 8 = 3 ... only log base b a value is substituted nothing else.. Hope its clear ;)

@sheetalsharma7587 Год назад

Explain it in pleaseee

@URLate Год назад

Same prblm 😢

@chupbe-qw1lr Год назад

n log 2 ^ 8 will be n^3 as 2^3 is 8

@lvna1754 7 месяцев назад

Answer kese aya 2^8=3 kese aya 😢

@user-dg9qy8st6s 4 дня назад

@@lvna1754 log₂8=3, it is reverse of exponent, think like this: 2 ki power KYA rakhne se 8 answer ayega ans= 2 ki power 3 rakhne se 8 ayega, so log of a (number) is just the power on the base to obtain that (number).

@no-body7286 3 года назад

this is the probably the best video to remember master theorem

@karthiksm9749 11 месяцев назад

The next day is my exam and I don't have any idea of any the subject... But after seeing his lectures is giving me next level confidence 🙂

@aryanpatle8436 3 года назад

Thanks sir I stuck in this problems but your theory solved it 💯keep going sir👍🏻✨

@Soumik1727 2 года назад

outstanding way to make us understand these difficult problem ,in a easy way. thank you dada ❣️

@muhammadibrahimtariq202e8 3 года назад

Easiest way to learn this topic... Thank you sir

@subid.majumdar 3 года назад

Wah bade vaiya mauj kardi 🙏🙏 Itna aasan aur engaging tarikese concept koi nahi samjhaya Thank You❤️❤️

@user-hf9ch6ct9s 7 месяцев назад

This is wonderful. Sir how simply you explain everything

@chandrakantpandey6817 Год назад

what a explanation THANK YOU SIR.

@imtiaznakib1040 3 года назад

it was very helpful....Thank you

@codingtriangle 2 года назад

sir you are great ... thank you very much for the explanation

@payalsonawane2404 3 года назад

Gate Smasher is best platform to study core sub related to get....ty gate smashers and obviously ty Varun Singla sir

@gopalchaudhary6170 3 года назад

really helpful , thank you so much sir

@jezzyk5998 4 года назад

Thanks a lot very helpful to prepare for exams

@MrAdilTalk 3 года назад

Sir ur doing great work thank you so much 😊

@veerannakotagi1059 3 года назад

Great sir.super explaination.

@user-lm6vi3tl1l 17 дней назад

Best teacher ever im able to do BCA just becz of ur videos and with good marks

@dhasvino 4 года назад

Thanks for this video to find the solution using master theorem.It is very useful for competitive exam.Thanks a lot.

@aanchalgupta3745 3 года назад

aapko h ki u(n) and h(n) kya h?

@brijeshgupta8165 4 года назад

bahut badhiya aadmi ho bhai aap!!! thnks a lot

@smidgenmount Год назад

thank you so much sir for making me understand this, I was not able to do this for a long time

@rounak3239 4 года назад

Gurujee shandar jabardast zindabad

@avichauhan6491 3 года назад

Sir too good explaination thanks for teaching.

@mohitkaushik21 Год назад

Wow, thanks sir😊

@skhojayfarahaman5867 3 года назад

Sir, you are my best teacher in my whole life❤️❤️❤️❤️❤️

@itsAhmadMallik Год назад

very easy and excellent way of teaching

@sonalisharma9589 3 года назад

thnk u sir. bahut ache se explain kra apne... mere mind m jaise hi koi doubt ata h... aap agle hi second m usko bhi explain kr dete ho. god bless you sir

@trickswithandro749 3 года назад

Mai ap key video dekta bad mai hu or like pehlay krta hu q k mujy pata hai k ap na sahi smjhaya hoga or ap hamesha sahi he smjhatay ho LOVE from Pakistan

@joelnadar3194 2 года назад

A Great Use of RU-vid

@sathviksrikanth7362 Год назад

Thanks a lot sir!

@harshvardhan3396 2 года назад

Nice explanation 👏👏

@prasannadhaygude6608 3 года назад

Thank you sir!

@minivashishta9288 4 года назад

thanks a lot,sir

@mohammadhasnat9630 2 года назад

Ohhhh bhaiiii bohatttt achyyy👍

@insil_ Год назад

Most easiest way to understand the master theorem, thanks a lot sir ❤

@GAU-C--RATNAKANTAHANSE 3 года назад

Thank you sir...

@Akashkumar_12 Год назад

thank you so much sir ❤❤❤❤

@hrithikrudra4292 4 года назад

Sir,please cover this subejct with placement point of view as well. As DAA and DS are the most important topic in placement scenario Thanks a lot.

@aviroxi 3 года назад

i can sense my brain cells increasing after watching this video

@piyushtripathi5566 2 года назад

Thank you sir ❣️

@krishanudutta2943 3 года назад

Excellent sir

@rohitraj3354 Год назад

Sir apke jaisa teacher pure country m nhi h apka video dekne k bad koi dusra video search nhi krna padta h!

@quak9144 2 года назад

your vedios are the best help 1 day before exam thanks

@mahirshadid 3 года назад

Great 😁

@ShubhamSharma-rp5tu 4 года назад

Sir u said that substitution method can solve any recurrence relation but here we are not given base case ?

@nafisfuadshad7377 3 года назад

bhai ne kya samjhaya hai yaar.😍😇

@rimshach3249 2 года назад

Thnkuu so much aj apki wajah. Se mera paper acha hua hai aur ummed hai k pass ho jaungi thnku🥰

@tanmaysaxena1943 9 месяцев назад

Thank you sir ❤

@PrasadMhatre 3 года назад

T(n) = 2 T(n/2) + n/logn herer when we are calc h(n)= (logn)^-1 So here i

@asitkumarsahu5211 4 года назад

Thanks sir

@BhagatBhutale.. 5 месяцев назад

Video is useful 👍

@shwetasharma138 3 года назад

Very easy to learn

@nooruddin2646 2 года назад

great sir

@namitsharma3449 4 года назад

Thanks sir g 👍

@akhileshyadav9862 4 года назад

Kya machaya hai bhai tune

@danishmehboob3883 Месяц назад

Nice interpretation

@PratimaYadav-bg3ug 3 года назад

Thanku sir🙏

@akash-yq5kz 3 года назад

Thankyou

@cscenter1544 3 года назад

Excellent

@nannubedi7773 3 года назад

Sir, thank you soooo much !! What my teacher could not explain in 2 hours, you explained here in 6 minutes. Please upload more problems with video solutions for practice also. Aur sir, aise hi har topic ko explain karna ! Good Job Sir!!

@aanchalgupta3745 3 года назад

aapko h ki u(n) and h(n) kya h?

@nannubedi7773 3 года назад

Aanchal Gupta haan.... U(n) is the function that is multiplied with n^log a base b.... and u(n) kaise Calculate karna hai vo sir bata chuke hai.... basically u(n) is also an input dependent function ...

@navjeetkaur5742 3 года назад

Thank u sir

@salmanmanzoor6702 27 дней назад

Love from pakistan....you are one of the best

@AnjaliDuttaRoyBEC 2 года назад

Thank u

@pushpak6523 3 года назад

mast padhaye bhaiya !!

@akshatkashyab800 3 года назад

Nice work Brother ,

@GateSmashers 3 года назад

Thanks 👍

@shariqiq517 2 года назад

Superb sir g

@GauravSharma-zh4gk 3 года назад

thankyou

@hinokamikagura4153 2 года назад

nice video

@kinzakitchen4789 3 месяца назад

Great sir ever

@diptomansingh5020 9 месяцев назад

what if h(m) = n2/n2 ? then it's n0 =1 , r=0 ! then which condition should i follow

@hassanistic Год назад

Research proves that he's the only teacher

@yashsethi69 2 года назад

sir incase logn has -ve power then which case to use ?

@shibanandadas7727 3 года назад

How we can find order of any function Ex.O(2),o(n^3),o(sinx),sin(ax+b)....?

@aliather2723 2 года назад

amazing sir! your kind of teaching is best then my university professor

@nishisaini8072 4 года назад

Thank you sir Aapne meri problem solve krdi

@aanchalgupta3745 3 года назад

aapko h ki u(n) and h(n) kya h?

@deepakshisharma2660 3 года назад

8T(n/2)+n^3 sir then what would be the value??

@ramankr0022 5 месяцев назад

thanks sir,

@AbhishekKumar-rj8rt Год назад

sir what if its - instead of + sign ..then ?

@tinniroy-kg5gc Год назад

I generally don't comment, but you saved my gate exams!

@jeetyadav68 Месяц назад

n3 issliye hua kyuki Log 8 with base 2 == 2x2x2 = 8, 3 times 2 to get 8

@riteshchandraroy1395 2 года назад

sir we can use masters theorem for Decreasing functions as well....

@nikhilsaxena6722 4 года назад

sir what is the meaning of U(n) and h(n)??

@sahityapadaga4026 2 года назад

What should we do if the value of h(n) is 1.It matches no cases..

@adityagangrade9955 Год назад

how it will give n^3 value

@anmolkumar2975 3 года назад

how can I calculate h(n) in 3T(n/2)+n^2

@goutamdey4083 3 года назад

When to use theta notation and when to use big o

@AditiVerma825 9 месяцев назад

Thankyou sir for your explanation Sir I have query that master method can also be solved without finding U(n) by using formula

@sudiptasall6480 Год назад

Hail for this man 💯❤।।। 😌

@BishnuPasa 2 года назад

best

@AndroidMasterPK 4 года назад

Kindly make a video on recursion tree method

@PriyanshuPareek 4 года назад

Hi sir, great explanation. Just wanna point out that the question was T(n) = 8*(n/2)+n^2 because otherwise, it does not match with the formula. Thanks a lot anyway sir!!