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

[@shubh-3737]

youre just too good sir! words cant express how grateful i am to you. thank you sir.

[@ayeshashrafayeshashraf2985]

your method to teach is very interesting and easy thanks a lot sir

[@samyukthas4455]

not only algorithm.. but also learnt hindi from your lecture :)

[@mukeshsheoran4863]

😂😂 exactly

[@ashutoshdas7300]

Sirf bakchodi nahi, english bhi sikha maine tumse :)

[@deveshkumarpathak9851]

@@ashutoshdas7300 😂😂😂🤭

[@lillyput2275]

Yup 😂😂exactly

[@sohampande5254]

@@ashutoshdas7300 yeah boi

[@emotionalhubs-4518]

I am BTech student of 3rd year (cs branch) ,tomorrow is my sessional exam ,I am very happy from your good lecture

[@ghulamhasan1978]

same your's lecture are according to our syllabus😍

[@honest_review2492]

Ufffff sir great itni mushkil cheez ki itni asani say smjhya hn 😊😊😊😊👌👌👌👌👌👌

[@bishalchakrabortty2543]

sir aap ho toh aur kya hi chahiye .....respect u sir.

[@subid.majumdar]

Easy to understand, thank you Sir

[@maheenmustafa7712]

Saving lifes of students from previous four years 🎉 i see 💗

[@neelamverma8841]

What an explanation sir i wasted so much time in understanding this but you took only few minutes to make it understand

[@rajnishchauhan8208]

00:02 The recurrence relation for Binary Search is T(n/2) + c. 00:41 Recurrence relation T(n) = T(n/2) + c analyzed using Substitution method 01:22 Recurrence relation T(n) = T(n/2) + c 02:03 Recurrence relation T(n) = T(n/2) + c 02:49 Recurrence Relation T(n)= T(n/2) + c 03:33 Recurrence relation T(n) = T(n/2) + c 04:07 The time complexity should be written in terms of 'N' only. 04:53 Time complexity of Binary Search is Order of log N

[@sedativelimit]

I bet this is the only place where you will actually understand the concept

[@payalsonawane2404]

I can't control myself from commenting on each and every video because they are damm good............really tysm sir

[@leandroronan498]

dont know if anyone gives a damn but if you are bored like me during the covid times you can watch all the latest series on InstaFlixxer. Been binge watching with my girlfriend for the last couple of days :)

[@geraldjoaquin9159]

@Leandro Ronan Definitely, I have been watching on InstaFlixxer for years myself :D

[@osamachishti3726]

You are the best Teacher I ever listened. Love from Pakistan

[@kunalgautam8312]

I am studying DAA for my exam and I am watching this video today 19 jan, 2021 exact after 1 year of upload :)

[@sumanchhabra1801]

Same, my paper on Friday

[@unReaLDivyanshu]

hello , aapki job to lag gai hogi , koi advice bhaiya?

[@JayPatel-jm9rx]

placement konsi jagah hui bhai ? aur yeh DAA kitna kaam me laga ! please reply !!

[@motivateyourlife15434]

This method is very easy and it is very easy to understand, Sir thanks to you for this.

[@mohammedzohan4099]

Thank u so much sir,every concept will be made easy by u

[@idocoding2003]

Even my friends from microsoft watched your lesson during their college time..... ☠️💀👍

[@Adnan75ahmed]

Sir bohat acha parhaya aap ne. Ur video is too good

[@soniaduhan7890]

Sir please computer science se related compitative exam k liye online classes start krdo Apka pdaya shi se smj aata h

[@komalghafoor9953]

Zabrdast it was mind blowing I never learned like this👏

[@badhanaditi7899]

Very effective way of teaching thanx sir..

[@ritikkaushik3493]

bohot aacha presentation hai aapka thanku for these videos.. online lectures college ke samajh nhi aate main toh DAA ki class mobile par chala kar yaha apke channel pr video dekhta hu

[@anju4777]

sir your way of teaching is very interesting. thank you so much.

[@GateSmashers]

Thank you

[@MANISH-Dev]

@Gaming for life bro k = logn and sir is not dividing 1+kc by 1+log(base 2)

[@068_gauravchakraborty]

most simplest explanation thx a lot sir ji

[@SandVision03]

Very smooth explanation Sirjee

[@aadityasj1917]

very nice explination

[@ayushyadav1894]

in the end when we got the concept like "kya baat hai sir kya baat hai,,ye baat hai" P:s- Irfan khan dailouge.

[@aishwaryaambapkar1245]

t(n)=4t(n/2)+n ..by substitution how solve please tell me sir .

[@codewithdoge]

Oooooooo bhaiiii sahab itna easy tha yeeee...... Bhaiya mere professors ko bhi aap padha dijiye

[@muhammadmurtaza9247]

wonderful Explanation sir

[@abulhasnat9590]

well explained video.

[@dazzyboy5274]

excellent sir.. really helping me a lot

[@moosakhan9482]

Thanks 😊😊😊 it is my presentation topic

[@azizminhas8645]

Sir aik question Yh Jo ap n last p bola log2 is equal to 1 but is kii base same to nii Hy .. agr ap is ko explain kr dain olx

[@ibrahimislam845]

when will you upload recursive tree method

[@hiltonalmeida4259]

Muito obrigado, very happy!

[@FarmanOfficial777]

😭😭😭 Thank you So much gatesmasher you don't know how made i become to search the correct respective video to understand this concept....

[@BhagatBhutale..]

Video is useful 👍

[@nazinformative7425]

Thanks for video kindly also upload video on computational complexity

[@narendersinghraman4529]

Very Nice and elegant content.

[@Jobupdates.24]

Excellent sir g

[@Kushal145]

Log 2=1 kaise ho gya

[@anuragpal2114]

smartest guy from section D

[@MaxJohn-bp5cu]

Log base 2 and argument same

[@secretchef1579]

Wow same example video I got

[@learncseasily3385]

Upload more questions of Recurrence relation plz

[@tathirraza5248]

The way of explanation is tooooo goood 😎........ Awesome.

[@bikashsingh4736]

4:56 -> How log 2= 1

[@abdullahimai-abba5982]

Apparently it's in Base 2 not base 10

[@khankhan5440]

​@@abdullahimai-abba5982 what u mean??

[@abdullahimai-abba5982]

Damn I'm sorry bro I graduated a few months ago, I can't even remember how to do this 😭

[@salilshukla2686]

very easy explanation sir

[@nikitakhinchi9907]

Tq so much sir very helping video

[@SuhailRaza92]

Daroon lecture ❤

[@ruchibhatnagar6335]

sir, you explains so easily, thanks

[@ashutoshsinghkhadka1265]

Array starts from 0?

[@danishfareed7858]

Excellent bro

[@harini.a7934]

Very clear explanation ....

[@abhi34776]

love the way you teach sir

[@asifsukhera5643]

In this question plz clear that how we let n=2k

[@dipikadhami5219]

Iteration method ki video bhi banao

[@AshwaniKumar-gt9vv]

Thanks a lot of you sir 👍👍👍

[@nathalieibrahim7484]

thanks broski but this is the iteration method not the substitution one

[@namitvarshney2142]

Sir please upload more questions on Recurrence Relation

[@ajayingle8049]

Can u explain by recurrence tree method ?

[@abdulelahtalents1789]

good day, we need to solve for: T(n)=2T(n/2)+c

[@manishayonjan5601]

Indian people are the best teachers. I dont know how i would pass my class without them.

[@deeparaj2305]

How we take n=2^k duration 4:10

[@asifsukhera5643]

Good question

[@BATMAN2003-t9j]

Thank You SO much

[@SubhranshuChoudhury]

Dhanyawad

[@tirathchy271]

Thank you so much sir🎉🎉🎉❤

[@khankhan5440]

4:56: Log 2=1 Tell me how ??

[@AMITGAIMER]

Bro base of log is 2 Then log2 =1

[@mohsinkhan845]

Superb

[@RNCSSakshamBhatia]

Recurence relation aur time complxity mein kya relation h

[@fardilviews]

Love from Bangladesh

[@ompalod3942]

Good

[@shubhambelwal674]

T(n)=T(n/2)+constant the above equation is time complexity or recursive relation ??

[@jeetyadav68]

recursive relation of Binary Search

[@sathviksrikanth7362]

Thanks a lot sir!

[@SaloniKumari-nc2cq]

Sir , if there is n^2 in the place c what would we do

[@GAU-C--RATNAKANTAHANSE]

Thank you sir.....

[@sukhbirsinghkhalsait1956]

Log base 2 n mein 2 kider se aaya sir?

[@MS-qh3iz]

thank u for the subtitles :)

[@namitsharma3449]

Thanks sir g 👍

[@-Abdulrasheed]

Thankyou sir

[@tumhareaabaa2914]

Thank you sir !!

[@akashlade9290]

Sir in second iteration T(n/2`3=6)+c so combination is T(n/6) +3c I m confused About This Stuff!!!.

[@daze9405]

4:55 how does log 2 becomes 1 plz explain 🙏

[@TechWithAroojJanjua]

Log 2 ke base by default 2 hoti is ka mtlab hota isko log 2 se divide krna hota now [ log(2)/log(2)=1 ]

[@jkyadav6121]

Sir aap computer graphic ka bhi vedio send kiziyega

[@bite091_jamee7]

amazing lecture

[@YellapragadaVSMRamaRao]

Why we take x=2^k

[@irealabdullah]

Can Someone Explain me or refer a video how Log(2) is equal to 1 I have to understand this because day after tomorrow is my exam & this question is included in my exam .

[@noorhassanwazir8133]

Thanks

[@pumpingarena1042]

Koi mera niet ka bhai agr daa ke paper ek din phele dekh rha h to kike kro😢

[@ibrahimiltifat7045]

mann, too goodddddd

[@khushbu_pal]

Sir base mae 2 kyu lgaya?

[@rajeevchaturvedi3231]

Suriya bhaiii jindabad

[@riteshkumarmahato232]

Why log base 2 n y not log n

[@dipakkandel2934]

substitution method and iteration method both are same ?

[@continnum_radhe-radhe]

❤❤❤

[@zainwasem]

very dedicated

[@mahalakshmim2390]

Please post your videos in english or give English subtitles

[@sorrowtalks4382]

Your session is really good but I've one doubt. Can you tell why you took base 2 in O(long base 2)

[@thesudhanshushow]

since its easy to deal with powers of 2 so we generally take the base as 2

[@kanimozhisenthilkumar3604]

@@thesudhanshushow if we use for all log function with the base 2 or else for in this solution only Whether o(log n ) is crct

[@infernogaming9154]

Thanks for the video! Easily understood the concept. Keep going :)

[@jktraders6525]

6.6 ri8

[@krishnamahajan1748]

how log2 is 1

[@visual_oven_11]

I was thinking the same

[@jkdeo9325]

Log 2 with base 2 is 1

[@ubaidaliawan6894]

Thnk u soo much..