2.6.1 Binary Search Iterative Method
Вставка
- Опубліковано 25 сер 2024
- Divide and Conquer Method
Binary Search Method
Iterative Algorithm
Analysis of Binary Search Algorithm
PATREON : www.patreon.co...
Courses on Udemy
================
Java Programming
www.udemy.com/...
Data Structures using C and C++
www.udemy.com/...
C++ Programming
www.udemy.com/...
Holy shit. I am a senior student of Computer Science and I never REALLY understood these concepts until I watched these videos. I am literally watching the entire playlist to understand Analysis of Algorithms better. You are amazing for taking the time to make these videos. Sending thanks all the way from Texas!
Same here
@@lifeexplorer2965 Same here! (Master's student!)
I am a ECE student i learned all the concepts by my own...i am just here for refresh the concepts...only.
fck textbooks they only made me lost time
you are a senior cs student and you can't understand binary search ? wow, what do they teach you in that school ?
the audio gets better after 5 minutes or so. Thank you for your videos!!
I was searching for new earphones lol
And it gets worse again at around minute 18 Lol
@@adithyagowda4642 same
@@wirito gradieng
Thanks for the info
Abdul Bari is of the most gifted instructors I have ever seen on online videos. Thank you very much for the level of detail and the clarity of your explanations. I can say that your videos are the solid foundation for literally anyone studying these subjects before watching anything else. Congratulations!
Indeed
GOD DAMN. I have been through Udacity, Khan Academy, Coursera, MIT etc courses and THIS is by far the best explanation I have encountered. Holy sheeeeeet. Unbelievable.
Algorithms has become "Bachchon ka Khel" after watching your videos! Kudos, you're ultimate!!!
Really
So amazing. India needs more teachers like you.
You explain everything about the topic that's what I love the most.
more students like us too bro
Note that in practice doing mid = (L+H)/2 is not a good idea because it can cause an overflow since (L+H) can be greater than the list size.
Instead, we should do mid = L+(H-L)/2 to avoid any possible overflow.
Damn I was stuck on this in python for a while, took your advice and it works, you sir are a legend!
we can do the floor division to avoid overflow.
if you start l at 0 and h at length of list -1 you won't overflow
Most gifted instructor I have ever seen on online videos like this. Thank you very much your explanations.
Proudly he is from india❤💕🇮🇳
Proudly he is a MUSLIM.
@@hennaartbyreeka2675 wtf
@@Risefromtheashes689 yeah
@@hennaartbyreeka2675 allah didn't help him to gain knowledge you fool...it was his efforts 😂😂
@@hennaartbyreeka2675 if that is so ...he would have done namaz 😂😂😂😂 and not learn algorithms
I regret paying thousands of rupees to my college faculty. Abdul sir's explanation is always on point!
lol .. removed headphone and changed settings 4 times thinking the problem was on my end.. btw thanks for your lectures, you are a great teacher.
thanks bro I thought the same
If someone asks me to write binary search in future I will understand and I will write it instead of byhearting. You explained in such a way people will understand to the core. Thank you sir.
ignoring my university lecture (bcz they just read ) bcz i know Abdul Sir would make me understand in a better way !!!!!!!.
Thanks a lot sir. You are just awesome.
Great video Mr. Bari sir continue to educate CS students as myself, you have done a great job with this series and everyday I wake up knowing that I will learn something new from the master of teaching himself.
Where are u now
I completed my engineering but never got this precise and enlightening knowledge and details. Thankyou very much.Going to watch the whole playlist
the simplicity and thoroughness of your explanations are beautiful. thank you sir.
So far the best video on this topic I have ever watched he makes it looks simple and easy to comprehend. Thumbs up Sir
Sir you’re best teacher ever
Ma Shaa Allah
Best Binary Search Algorithm Video Ever!!!!!
I always thought that I'd been kicked in the head by a donkey until I saw this video. You save my life, thank you very much
Sir, Sachmuch maine aap jaisa explain krne wale sir nahi dekhe,
You will a good motivation towards understanding programming in a good manner ..
And plz upload concepts regarding c++ and data structures..
Again thank you for such great explanation....🤗👍🏻
Superb!!! Sir, you are great.... Fantastic... You made this course a piece of cake.
are you studying analysis and design of algorithm?
So good! Much more understandable than the video of self-claimed "competitive programmers" out there!
Best 19 minutes ever❤❤❤❤
A gem , I was tired of watching multiple videos but understood from Bari sir . Thanks a lot sir
Now Algorithm is My Favourite Subject
we are following you as an excellent instructor thank you, sir, we are so much grateful
Sir, U explained this algorithm with so ease........ Thanku so much for ur guidance.....Looking forward for more such tutorials.
Bari ji Keerthan holla aapka bahut bada fan hai, aur aapka ghanta bajata hai hamara hostel mei.. thank u
May Allah reward you for this explanation
May God bless you and make it in the balance of your good deeds
you help me alot ,
thanks for sharing this concept,
now i got how binary search works,
really nice work, wonderful presentation
sir i have only watched this video of yours and i am already your fan! this was very very very much helpful! sir charan kahan hai aapke ashirvaad de do plz
God Bless You.
Your explanations are brilliant! Greetings from Russia
Thank you for your videos!! I was not REALLY understood these concepts.But when i see your lecture's about this concept then I can understand the Analysis of Algorithms better.
sir,please make videos on data structures also.
you can buy it from Udemy!
Yeah Purchase the course on Udemy. It is great!!
@@geekyprogrammer4831 is the course instructor himself?
@@gavravdhongadi9824 yep .
I had also bought that course .
It is worth every penny .
this guy knows everything about trading! I really recommend you to check all of his videos
Sir thanks a lot for making such awesome videos .Your videos are too good! You teach far better than an average teacher.
He explained in the most simplest form. Today I understood correctly what is binary search. Thanks Sir.
I have question though- Array index starts from 0, then why are we calling it 1 in this case. Thanks
You are absolutely gem ❤️. Perfect teaching any student can understand i was struggling with this ,and in just 20 min i got it. Thankyou and God bless you
Sir u r great..plz makes videos on data structures with code and give some problems to practice.
Sir,Array's counting starts from 0 to (n-1) but you have started the counting from 1?Is it possible to do that?
also when the key is not found the return should be -1
usually in sudo code, counting starts from 1 to n.
Thanks alot Sir, your explanations always meet my expectation.
I'm amazed on how you make things look so easy. 👏👏
Amazing, i am beginner and i have completely understood all the concept easily
sir thanks a lot, i have been trying to learn it myself from so much time but after watching half of your video I coded it myself and it damnnn worked thanks sir
Sir you are great..helpful materials but it will be more useful if you explain topics from more basic concepts and would be best if you discuss these concepts in java or c# simultaneously..huge respect and love for you sir ❤️🙏🙏...
Sir at 16:14 you are calculating wrong height. The height of that tree is 3 not 4.(No of edges are counted and not the nodes).
The number of comparison depends upon height of a Complete binary tree as follows:- floor(logn) + 1
Anyways, Your content is awesome.
Ya sir right! By the way your channel is great too!!
Nice tutorials.While making videos, plz give basic details of the topic as well as its implementation in java.I apprerciate your effort to share knowledge which will have global reach.
echo is been produced the entire vedio sir, n gud luck for the productive lectures u gave, kindly upload some more fruitful vedios on computer architecture or other subjects
The explanations were so precise and clear cut. Thankyou so much Sir :)
Bundle of thanks sir for such comprehensive detail on Algorithm.
The Explanation were so clear cut ! :) Thank you !
the audio gets badly distorted so don't worry just wait till 5:30 and the it comes clearer !
thank you abdul sir, you have been a great help to the pandemic kids like us !
You are a blessing for humanity.
thank you so much sir. i had not understand this concept .your explanation has made this concept easy.
now it is easy for me
Oh shit ,finally got this stupid algorithm. I just want to thank u ,u saved my time.U are a very very good teacher.
From 5:26 audio is good
after 5:30 min video sound will be clear go ahed 👍
and thank you so much sir for this video you are great .
thank you so much for helping me out with this,so understandable when you explane it compared to my professor
What if array contains even elements? Suppose 16 total
Low=1 and high=16
Mid=(1+16)/2 =8.5
Should we take mid has int so that it becomes int mid=8?
Is that correct?
Same question 🤔................... sir please answer
Good example you took sir
Thank you, Abdul. Quality materials!
Best explanation forever
Thank you so much sir please provide the videos for all computer science based topic sir it's very useful for my exam.
This is really great video thanks a lot
Hats off to you Baari 👏
The best teacher in the world!
I am exponentially thanking you each video 😋
He is Bramha Of algorithms.
Thank you so much sir!!!!! You are literally God of Algorithms 🎉
what's with the sound?
No
@@abdul_bari No sir everything is fine
I really appreciate your explanation sir ❤
This guy right here is a fooking legend.
Sir Your explanation is very clearly, I have one doubt in list index starts with 0 but you take it as 1
If we also check low and high index for key along with mid [(just like we check if arr[mid]==key)], we will do less iteration and time complexity will be improved too.....
if(arr[low]==key || arr[high]==key || arr[mid]==key) --> return/low/mid/high;
great work !! can't thank you enough it really boosted my confidence
In your code, you return 0 if index is not found, but instead you should return False; returning 0 index will mean that element is found as the first item on array
Here is python code for the same that you explained :
def binarySearch(A,key):
n = len(A)
low = 0
high = n
while (low
CC is so much helpful for this lecture.
Brilliant teacher can you come to my school . Shout out from Dubai
Thank you. These videos are great tutorials.
Missing you sir 🙂
Syed Chand noo
Sir I have watched all of your lecture,kindly sir insertion sort per koi video zaror bnay
thanks Abdul, I think the binary function should return -1 not '0'. '0' is still a valid index.
he is not returning index of array, but position ! so he is right!
This guy is a genius. THE GOAT
very good explanation for a very confusing topics. well done prof!
Well done sir from Pakistan 🇵🇰👍
You are really genius, diamond of India
Sir add videos on insertion sort & its cases
One of the best explanations ever
very easy to understand sir keep shining
play the video at a faster speed to mitigate the audio issues
your surname in armenian means kind , thank you for your videos
Thank you so much for this clear explanation!
Sir i have one thing to say instead of initializing mid as( low+high) /2 we should write mid=low+(high-low) /2 to prevent overflow
Way of teaching is fantastic
I understand 15 is the amount of nodes, and log2 n. Why 15+1? why +1?
Thank you soo much.. Ur channel deserves million subscriners..
so simple with you
thanks for all the videos sir, the videos helped a lot :)
Assalamualaikum thanks a lot I understand it
Nice, Good Explanation