Binary search in 4 minutes 

another day, another person's semester you just saved

Best video on binary search I've found, straight to the point with well made animations. Thanks a lot Michael!

Thank you for using a black background and white text. All of your older sorting algorithm videos were really helpful.

Damn. I am commenting a bit late but man it's people like you who help me keep on coding and not giving up. Thank you! Amazing content.

CS UG student here, you are precise and to the point which makes you different from rest of the creators

Cool stuff Michael! Keep up the great work!

Amazing explanation. Thank you!

Your code is so simple and easily understandable, it helped a lot. My professor had 3 slides on it, very yuck. Thank you so much!

such a great explanation, I love your calmness

Ur the goat bro I just watch ur vids 1 hr before the exam and covered the entire 5 months syllabus ,🔥🔥

reviewing for a data structures quiz rn, this was exactly what i was looking for! 💪very clear and helpful explanation :3

Great Explaination! Could you make a video on Linear Search is well? :)

great vid man keep it up

i like your explanation:) keep it up

amazing video keep it up!

Nicely explained!

0:35 generally it will be rounding down since int always kind off round down by default in more languages

hey, try median bucket sort, its 2n log n, ie, first linear median search O(n) then split the elements to two buckets, repeat for sub-buckets

thank you so much !

you are a legend

Please please please keep making videos, I watch your videos everyday, you make my day, thank you

Curious if it would behoove the algorithm to check if either left, right, or mid is the answer

THANK YOU

Bro is actually a godsend

lifesaver

Just a quick question, after finding the average of index, if that mid position happens to land on the target index, does the search stop and the target is found?

thank you

niceeee

Him: “quick sort=pivot” Me: “WHILE HE HID IN RADIO WE PIVOTED TO VIDEO 🗣️💥”

I watched previously the video where you explain the Big-O Notation, in it you showed ant the end that in a "IF -> ELSEIF -> ELSE" the time complexity would be O(n^2). At 2:47 there was an "IF -> ELSEIF -> ELSE" why is the time complexity in this case O(log n) and not O(n^2)?

bro should be known by more people

👏👏

can you make one on linear searches

Whats the purpose of returning specifically -1 if the target value is not found? Why not simply state that the target wasnt found?

These search routines are canned so you can just grab them and use them

nice explanation but how do i know the time complexity?

why do we return -1?

what if the number 29, how will it work

Why not return array[mid], why return mid I don't understand

There are 14 numbers in this LIST.. so Average should be (0,14)=7

𝓅𝓇𝑜𝓂𝑜𝓈𝓂 ✔️