00:02 Recurrence Relation is a function that calls itself multiple times. 01:05 Searching for an element in a sorted array 01:52 We are calculating the middle element of a problem N 02:46 Searching takes a constant amount of time to find the median and check conditions 03:45 Binary search algorithm divides the problem into two parts and navigates based on conditions 04:42 Finding the middle element in a given range of numbers 05:29 Dividing the problem into subproblems 06:24 Recurrence relation of binary search can be solved using substitution method, master theorem, or recursion tree
We are IT students and our Big problem is that our teachers Said "beta TH-cam sy lecture le lwna Tum IT student ho tumara tohhh 2sra ghur TH-cam hona chahiya "😅😅
Teachers ko bolo: "Aap fees bhi next sem se TH-cam se hi le lena, kyunki vo hamara second home hain... Agar TH-cam se hi sikhnaa thaa toh aapne kyaa kiya students ke liye, aapko fees kis cheez ki de..? "
Thanks a lot sir for these lectures. they really make Data structures easy. I have been following your lectures from the last semester. They r very helpful!
Best faculty I have seen ever......😊😊😊🤷🤷🤷.... Sir u always clear every topics whatever u teach .... U teach with full enthusiasm😍.. God bless u sir 🙏🙏🙏🙏🙏
Really good content. Very helpful . You make it very very easy to understand the algos. :) Stay healthy :) Always revisit your videos for better understanding.
Sir kya vidio bnate haii aap Aapne set ,abeliean ,moloid, semi , Sir aap manna padega Koi aisa studen hoga hi nahi jise samajh mein n aaya ho Thank you sir
Sir all your videos superb because you explain each and every concept in the simplest way as much as possible so that students can remember it for lifetime. And in our country we need more teachers like you who actually wants the students to succeed in life
🎯 Key Takeaways for quick navigation: Recurrence relation involves a function calling itself repeatedly. Binary Search Algorithm helps in understanding and writing recurrence relations. Binary Search works effectively on sorted arrays by dividing the problem into halves. Recurrence relation for Binary Search involves T(N/2) along with constant time operations. Methods to solve recurrence relations include substitution method, master theorem, and recursion tree. Made with HARPA AI
You always take the floor value buddy, even if you write this in a program, let's say mid is an integer variable , if mid comes out to be 4.8 , the actual value stored in mid would be 4 and not 5, and since mid is integer it will typecast the decimal value, try doing it on an IDE
@@GateSmashers sir plz complete all the gate playlist as soon as possible and again thank you sir for your super simplified and easy to understand contain 🙏🙏
Hello Sir! just wanted to know that if there is any difference between substitution method and iteration method for solving recurrence relation? Thanks
sir ap prhate to ache pr kindly bar bar hr video me (competative or enen that universirty exam ke lie bohat important he topic ......) ye bat na kia kre
Best DAA lectures ... Never thought that DAA could be so amazing to learn :D
thank you so much :)
Ab to tumhe NASA me job mil jayegi
00:02 Recurrence Relation is a function that calls itself multiple times.
01:05 Searching for an element in a sorted array
01:52 We are calculating the middle element of a problem N
02:46 Searching takes a constant amount of time to find the median and check conditions
03:45 Binary search algorithm divides the problem into two parts and navigates based on conditions
04:42 Finding the middle element in a given range of numbers
05:29 Dividing the problem into subproblems
06:24 Recurrence relation of binary search can be solved using substitution method, master theorem, or recursion tree
Great teacher.. I Have seen your 1000 of lectures.. recommended this channel to every student.. Stay blessed
At present 7dec 20 till now sir has only uploaded 787 videos😂😂😂😂
I personally counted 787 videos only 😂😂😂
Loved your comment. 👍👍😘😘
Thanks and welcome
I think she has watched all the videos many times...hahaha
Commenting first time on any video. You made me pass my exam...lot of thanks my brother 🥺❤️
All the best
Bhai tu kia chiz ?? Kia knowledge hai tery pass humry teachers is tarh parhna start kar de to study bhut bhut easy ho jaye 😉
We are IT students and our Big problem is that our teachers Said "beta TH-cam sy lecture le lwna Tum IT student ho tumara tohhh 2sra ghur TH-cam hona chahiya "😅😅
Teachers ko bolo: "Aap fees bhi next sem se TH-cam se hi le lena, kyunki vo hamara second home hain... Agar TH-cam se hi sikhnaa thaa toh aapne kyaa kiya students ke liye, aapko fees kis cheez ki de..? "
Likhna Sikh le bhai phele
Lagta nhi tu IT student hai 😅 likhna sikha le
😂😂😂
@@hansketrathod1535 lodu tu khud to sikhle
Thanks a lot sir for these lectures. they really make Data structures easy. I have been following your lectures from the last semester. They r very helpful!
Best teacher on You tube😊, you helping alot
You're the best. The English CC helps a lot!
Thank you sir 😷 stay Healthy
Hello Sir . Your Videos are genuinly very helpful for all categories of students. Thanks a lot.
Thanks and welcome
Thank you so much sir.
I am learning DDA in 2022 and is very helpful for me
Best faculty I have seen ever......😊😊😊🤷🤷🤷....
Sir u always clear every topics whatever u teach .... U teach with full enthusiasm😍..
God bless u sir 🙏🙏🙏🙏🙏
Best teacher 👍and thanku so much sir
Sir I learnt a lot from your lectures and hindhi too 😀
Very good lectures i feel so relax when saw your lectures sir
Best Computer Science Teacher in the world.
Sir I feel relaxed when I find your videos related to my topics❤️❤️ thx so much sir 🙏 god bless you
Really good content. Very helpful . You make it very very easy to understand the algos. :) Stay healthy :) Always revisit your videos for better understanding.
Sir bht ach syllabus complete krwa rha ha ap thanks
sir app bahut accha explain krte ho👏👏👏👏👏
Sir kya vidio bnate haii aap
Aapne set ,abeliean ,moloid, semi ,
Sir aap manna padega
Koi aisa studen hoga hi nahi jise samajh mein n aaya ho
Thank you sir
Sir all your videos superb because you explain each and every concept in the simplest way as much as possible so that students can remember it for lifetime. And in our country we need more teachers like you who actually wants the students to succeed in life
Sir i Am from pakistan
Love your behavior and style of teaching
Amazing lecture i ever seen!
Great one sir.....❤👌..merge sort,quick sort recurrence relation derivation ki video jaldi banado sir..plz...
Waah sir ❤️❤️❤️
Thank you sir god bless you❤❤
Best teacher ever ✌️
sir it's easy to understand daa thank you for motivating and helping me in study
🎯 Key Takeaways for quick navigation:
Recurrence relation involves a function calling itself repeatedly.
Binary Search Algorithm helps in understanding and writing recurrence relations.
Binary Search works effectively on sorted arrays by dividing the problem into halves.
Recurrence relation for Binary Search involves T(N/2) along with constant time operations.
Methods to solve recurrence relations include substitution method, master theorem, and recursion tree.
Made with HARPA AI
Best explaination ever sir!!! Thank you so much Sir
Sir please please make a video on Strong Induction
Thank you very much sir🙏
this in gate 2022??
Well-done sir👌
Sir .....if( i+j )happens to be odd....then how we will find out the mid....
Will the sub arrays be of unequal size.....please do reply
You always take the floor value buddy, even if you write this in a program, let's say mid is an integer variable , if mid comes out to be 4.8 , the actual value stored in mid would be 4 and not 5, and since mid is integer it will typecast the decimal value, try doing it on an IDE
sir u been doing great work love u
Gurujee shandar jabardast zindabad
Dil sei shukriya ❤
Bhai tumhare channel k bare me phle pta hota na.. amazon me hota mai
Great job
V.good effort
wonderful as usual 👍👍
Nice explanation :)
crystal clear explanation.....ty sir
Amazing sir its difficult but u make it easy thank u so much
Your the best teacher....
Love from Hailakandi, Assam
It's very helpful 👍
done
dhanyawad !
Video is useful
Best teacher
Sir the way of your teaching is mind blowing. I have a qns. Could u pls solve it?
Great explanation sir.
sir you look like parmish verma
Wonderful job sir....
Good teacher ever
You are best teacher
Too good explanation
Is this playlist cover all topics completely ...?
Partially completed..will complete soon
@@GateSmashers sir plz complete all the gate playlist as soon as possible and again thank you sir for your super simplified and easy to understand contain 🙏🙏
Awesome sir🖤
superb lecture
sir - excellent =please give more solved examples
GREAT SIR
I think indexing starts with zero so i should be equal to zero ie i=0 and j=6
01:15
Thanks 😊
Hello Sir! just wanted to know that if there is any difference between substitution method and iteration method for solving recurrence relation?
Thanks
How to calculate number of clock cycles in computer organization subject (Control unit design) please explain this sir🙏
6:34 WHY ARE WE TAKING C?
Thank you sir....
Thanks sir g 👍
Thank you sir
thnx:) 💌
Very nice
Hidden gems.
Sir recurrence relation r^2-r+1=0 ye vala eqvison ka video ?
Grt
sir apko unacadmey ne abtak contact nahi kiy kya?
2 saal se piche padde hai
@@GateSmashers vahi to kitna quality content hai aapka ,bass abhi bich me hi chhod mat dena please
@@GateSmashers 😀😀😆
sir agar value of j even ho then hum middle value kese select krenge
sir plz upload lecture on catalan numbers nd catalan series
watching from pakistan
Kya hmen written notes mil skty hyn? Inhi topics k
if the elements in the array are even then how to find midpoint.
Nice sir
Sir plzzzzzz inclusion and exclusion principle ke video Bana dy
What if mid comes in decimal ?
We take mid of type int so it never give decimal answer
If your mid 2.5 round it to 2
sir what is this method ? itration or subsitution ?
Thanks a lot.. sir for every piece of knowledge..
Whenever College exams are going to approach everyone in my college is like watching ur videos lol
❤❤❤
💯
Sir very aapki
Sir, 1.9 no. class kaha hei?
💯💯👍
No forward substitution ?
completed
and what if the size of array is even?
Sir Lt Grade computer ka batch la rhe ho kya
sir ap prhate to ache pr kindly bar bar hr video me (competative or enen that universirty exam ke lie bohat important he topic ......) ye bat na kia kre
Please explain in english too, for a better understanding of students from other states.
find another channel bro , max people in india speak hindi :)
if the array is unsorted how can we find the mid?
You have sort it first