Binary search in 4 minutes

Binary search in 4 minutes.

Sources:

[theatticbywik]

another day, another person's semester you just saved

[harshvardhansingh]

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

[NeerajSamshette]

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

[nalskipper]

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

[amitos]

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.

[duelingo]

u r singlehandedly making algorithms easy for people keep it

[theanamex]

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!

[glenn]

such a great explanation, I love your calmness

[sudhirms]

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

[Czarcasm.]

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

[Anonymous-rimk]

Oh this makes it so much easier i was watching the visualisation but i just get confused lol since i am not very perceptive thank you this helps a lot

[yorgodev]

Cool stuff Michael! Keep up the great work!

[okok-sccx]

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

[DavidZapata-qn]

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)?

[Neb_Explains]

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

[SunsetsOverBatteryCity]

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

[t_ahmad]

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

[Jkauppa]

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

[techytech]

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?

[sweetphilly]

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