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

Подписаться 2 млн

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

50% 1

#MasterMethod#algorithm
👉Subscribe to our new channel: / @varunainashots
►How Master Theorem Works: • L-2.6: Recurrence Rela...
►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/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com

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

2 окт 2024

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

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

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

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

Whenever im free , i put on his video on youtube but i dont watch it, so that he gets the views and ads for doing such a great work for free :) @Gate Smashers

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

Wow.. Thank you so much

@hemanthsaimadala4135 8 месяцев назад

One gmail account gives only one view no matter how many times you see

@complexyt6245 8 месяцев назад

@@hemanthsaimadala4135not now

@naveensingh9436 8 месяцев назад

@@hemanthsaimadala4135perhaps viewed hours are counted

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

@@hemanthsaimadala4135To ek hi vid thodi dektha hoga sari dekhta hog na bhi.... akela admi aur kya kre 😅😅😅😅

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

Do we need to necessarily bring down the constant while calculating the U(n) ? (The one which we multiplied with logn) Because through the table only the logarithm part is said to be considered

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

Where is the link for questions?

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

T(n)= 8T(n/2) + (n^3/ log^2 n) sir for this question your method does not work h(n) is does not have category for to get u(n) T(n)=4T(n/2) + (n^2/ log n) same for this question

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

Thanks Sir It helped me after 1 year of upload and helpful to others too. 😊😊 Thank You For practice questions 😃!!

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

you are hope of many engineers 😊

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

I've been following you for almost a year now. It's been really helpful throughout. I've suggested your videos to other students as well. Thank you for wrapping up the whole idea in a few minutes clearly.

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

The video was really good and helpful. Thank you for the practice questions!

@ophelia-_-aaa 3 месяца назад

I cannot find the practice questions. Can you please share the link?

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

sir i really appreciate your efforts and your teaching skills. i have a request could you please make videos on iteration and recursion tree method?

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

Soon we will upload...

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

hello sir, can you please explain this question The running time of an algorithm T(n), where ‗n‘ is the input size, is given by- T (n) = T(n-1)+ 1, if n > 1 = p, if n = 1 where p, q are constants. The order of this algorithm is-

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

try back substitution. Master's Theorem is invalid for this question.

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

One of best videos i ever seen sir. Thank you so much sir. waiting for more videos related to gate exam ?

@TheInfoGenie-bv2wt 3 года назад

SIR YOUR CONTENT IS VERY LESS BUT ITS EFFICIENT IN MAY TIMES

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

Thank you sir for all the questions you provided. It helped me so much for my exams.

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

sir if log(base2)power(n) = nlog2 = O(n) then why we put it O(log2N) atlast

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

short and easily explained ...thanks a lot

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

Thank you so much for the practice questions .. love you sir ..

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

u can share with me those practise questions

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

Sir agar h(n) jo hain 1/log n hain toh kya karenge, U(n) ke liye please explain sir???

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

Same doubt. .

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

If u know then please reply me. ..!

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

Tq so so much sir. This video is very useful.... sir can u pl make d videos on imp topics, tricks and tips for questions on algorithms considering nic -nileit exam

@VAISHALIBEDI-h9m 4 месяца назад

Well explained sir!!thnku

@karthikbandi8211 Год назад

Hi sir your videos are most interactive and easy to understand I have one query regarding the question 3 in the document provided in the link. If I calculate it is resulting me 8T(n/2)+qn = n, but the correct option in the sheet provided as n^3 could you please, explain this problem.

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

crystal clear concept explanation.

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

Really great sir.

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

could we just say that if h(n) is constant then the T(n) will always be O(log(n)) ?

@NidhiSingh-qi5ip 4 года назад

Sir if there will be log in f(n) then how to solve that by this table for example T(n) =2T(n/2)+n/(log^2n)

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

all great videos sir

@ARSAGAMING69 4 месяца назад

where is practice questions ??

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

Such an amazing Master theorem explanation! Literally the best on the internet! Thanks a lot for this @Gate Smashers ❤

@marrapumani 10 месяцев назад

sir U(n)=(log n) not (log n).C

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

Sir gate exam ke liye master theorm par jyada focus kre ya substitution method par recurrence relation mein??

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

f(2N+1)=f(2N)=f(N)+logN sir how can solve it the answer give in upper bound

@sujalthakkar6436 4 месяца назад

I can't find the link to the file where more problem questions are given. can you reply me with the link in comment?

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

Is it always the case that we get the log to the base 2 in the third case for U(n)?

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

Sir iteration method ki video plz

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

Sir what about master theorem for substract and conquer... Please upload sir

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

The running time of an algorithm T(n), where ‗n‘ is the input size, is given by- T (n) = T(n/2)+ logn, if n > 1 = p, if n = 1 where p, q are constants. The order of this algorithm is- (a) n2(b) loglogn (c) logn (d) (logn)2 i am getting loglogn as answer on this problem sir.

@JaskaranSingh-hw5jf Год назад

(Logn)^2

@KhushiDhillon-v6f 14 дней назад

Sir please mera ppr hai kal....aapke method se mera ye answer sahi nhi aa pa rha...please help me out...t(n)=2t(n/2)+nlogn master theorem

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

Sir i have a question.. if my eq is t(n) = 8T(n/2)+3n^2 how should i solve it

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

So beautiful sir.From Bangladesh.

@teeshasingh3103 4 месяца назад

Where is the Question File? I couldn't find it in the description box.. Thank you for the amazing lectures sir❤

@SubhakshanKarmakar 4 месяца назад

4th sem?

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

Sir, is this another method of master's theorem?

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

Sir , would U pls attach answers for the qns using substitution method . Using master method it's easy to solve but using substitution method I am not getting ans . If any one solved using substitution method for the practice qns pls .... provide ans document

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

sir what if we get h(n) = (log n)^-1 then it will go in which case??? the question was T(n)=4T(n/2) + n^2/log n kindly answer this sir, your method is very effective but I cant get this question @Gate Smashers

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

Sir, practice questions are no longer available there...

@AnjaliKumari-xj4ub 3 года назад

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

please upload solution of practice questions,

@GauravSharma-rb9mm 5 месяцев назад

where are the practice question bro

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

sir please slove this T(n)=2T(n/2)+n/logn

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

Thank you for giving practice questions. Ab sabke Gate SMASH kar dunga!

@cricketclip357 Год назад

Solve the following recurrence equations: (8 Marks) (i) T(n) = 2T(n/2) + 0(n) (ii) T(n) = T(n - 1) + 0(n)

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

completed

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

In a very short time u became my hero in all the teachers. Please keep teaching sir very soon you will become the best teacher. I really appreciate and very much impressed with your knowledge sir. Not only this subject u cover every part of DAA, CAO, Electronics which were burden of yesterday, you made it all crystal clear

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

How did the value of i=0 ? please you didn't explain it.

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

U are god

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

Sir, Can we get the answers uploaded for the practise questions you have shared so that i can verify the steps followed are right or wrong?

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

Where is the link please share here i didn't get it

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

Sir it's not working on 5T(n/4) + n^2,

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

how to find "i" value

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

@Debasree Rocz thanks

@adilsheikh2735 8 дней назад

sir where is the link for the file where the questions recurrence relation are given ?

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

Can you please solve T(n) = 2T(n/2) + nlogn using the same concept ?

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

Did you find any answer to this??

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

Sir i have a ques can please explain it T(n) = 2T(√n) + logn

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

Did you got the answer? I too have the same query.

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

did you find the solution ? if yes, how can we do that ??

@indian_tech6185 Год назад

if Someone Solved that PDF Questions Please Help me or share the Solutions I hardly need it..

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

If n ki power zero then what

@Naveenkumar-oz1rt 4 года назад

Sir i don't know how to solve log question.............means what is value for nlog33

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

Sir please help

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

Where can i find the notes?? Can anyone help i can't find those notes of unsolved questions

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

Great

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

kindly solve the recurrence relation t(n)=t(3n/4)+1

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

o(logn)

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

If sir H(n) =2^n then what will be the value of U(n)?

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

Did you find any answer to this? Or does this method doesn't work for this

@loganweaponx1356 4 месяца назад

Can anybody tell me , yeah (log2n)^i+1/I+1. Yaha I ka value kaha s aaya

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

QUESTIONS IS WHERE CAN YOU SEND ME THE LINK ?

@indian_tech6185 Год назад

Can you please explain the Given Pdf Link Questions =...:) I have solved the Questions but there is confusion in Some Questions...

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

plz solve this question, mera is waaly quest ka answer sahi nhi arha T (n) = T(n/2)+ logn, if n > 1 = p, if n = 1

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

i have doubt in a question plz rply me sir question is T(n)=25t(n/5)+n^4

@shortlifeengineer9485 Год назад

In i was see this topic .I think like this is very dificult topic now this time this very easist topic in this syallbus

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

T(n) = 8T(n/2) + n^3/logn what is the time complexity of this question and why

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

Why the value of i is 0

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

how to solve T(n) = 2T(n/4) + sqrt(n), T(1)=1 for n >= 0 a power of 4 using this method

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

or second thing ye hy k meny question 1,2,7 ,6 ko solve kya to mera answer T(n) waaly step me sahi arha hy or jb me H(n) find krna start krta hn to mera answer apky answers sy match nhi horaha?? ap mujy email address bataen me apko details email krta hn

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

Are koi 2nd Ques.ka answer batado yaar..

@kirandaksh1604 2 месяца назад

Sir file ka link provide kar dijiye questions wali please 🙏🙏

@black-sci 7 месяцев назад

Sir ye table kaise ata hai?

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

Please provide me the solution of Q3 in the attached practice sheet.?

@islams_beauty-c8c 5 месяцев назад

sir web technologgy ki playlist share kar dan

@kiranrai3686 Год назад

I am not understanding why you are ignoring the h(n) = C, why you are directly considering h(n)=0, since we have c?

@sanjaypatil3097 Год назад

He said you can take np

@nj10018 Год назад

I think u r stupid things enough to not understand this easy tutorial, he clearly said your u(n) will not come . 🤷‍♀️🤦‍♀️🤦‍♀️🤦‍♀️🤦‍♀️

@_schemaki_ 4 дня назад

3:43 bhaiya file kaha milega?

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

Sir log vale questions galat ho rhe hai please

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

sir apny practice question prov kye hen mujy smj nhi arha h k kis question ko substitute waaly or kis ko master theorem sy solve krna h. mujy bataen k hmen kesy pata chalega plzz