Binary search in 4 minutes

[@theatticbywik8238]

another day, another person's semester you just saved

[@MichaelSambol]

Boom! Awesome.

[@masterhimanshu8467]

Lmao I am having my practical today and I am doing this now... That too without laptop... 😂 And I have to do it in C language lol

[@harshvardhansingh5507]

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

[@MichaelSambol]

great to hear!

[@NeerajSamshette]

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

[@nalskipper7447]

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

[@MichaelSambol]

you're welcome, thanks for watching!

[@amitos1646]

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.

[@MichaelSambol]

Thanks bro! Keep going 💪🏼

[@duelingo8731]

u r singlehandedly making algorithms easy for people keep it upppppp

[@glenn7422]

such a great explanation, I love your calmness

[@MichaelSambol]

thank you!

[@BirukBelayneh-rq2we]

damn, this is amazing and exactly what i wanted as a python beginner currently. thanks Michael

[@sudhirms6507]

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

[@theanamex9969]

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!

[@DavidZapata-q4n]

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

[@MichaelSambol]

Might be helpful to watch the whole playlist on analyzing algorithms: kzbin.info/aero/PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv

[@Neb_Explains]

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

[@Anonymous-ri4mk]

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

[@Czarcasm.]

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

[@hojongyu8243]

Amazing explanation. Thank you!

[@yorgodev]

Cool stuff Michael! Keep up the great work!

[@okok-sc2cx]

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

[@MichaelSambol]

More coming! 4 weddings in October stalled my progress. Thank you for watching!

[@ZandalfBunt]

@@MichaelSambol 4 wives? As expected of Mr. Sambol.

[@anirudh4946]

Nicely explained!

[@MichaelSambol]

thank you! I appreciate you watching.

[@t_ahmad]

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

[@SunsetsOverBatteryCity]

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

[@eliyoung9406]

Bro is actually a godsend

[@enebenzer-p6t]

can you make one on linear searches

[@techytech07]

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?

[@MichaelSambol]

yep. see code here: github.com/msambol/youtube/blob/master/search/binary_search.py

[@techytech07]

@@MichaelSambol Great! thanks a lot

[@jakubrembiasz8942]

amazing video keep it up!

[@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

[@sweetphilly2]

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

[@ziyad7780]

i like your explanation:) keep it up

[@vraimoi]

great vid man keep it up

[@doodle_mo_ka4336]

bro should be known by more people

[@magma6554]

you are a legend

[@MrBurn666]

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

[@MichaelSambol]

Can do either :)

[@nurpaujiana4664]

thanks bro, iam understand now

[@stutipande2542]

why do we return -1?

[@MichaelSambol]

returning -1 if key is not in the array. otherwise return the key: github.com/msambol/dsa/blob/master/search/binary_search.py#L9

[@rain_yy]

nice explanation but how do i know the time complexity?

[@rain_yy]

do i calculate or something? hehe

[@MichaelSambol]

Take a look here, this should help: kzbin.info/aero/PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv

[@rain_yy]

thank you Sir !! @@MichaelSambol

[@jwinwithin5124]

what if the number 29, how will it work

[@MichaelSambol]

Try it here :) github.com/msambol/dsa/blob/master/search/binary_search.py

[@migy220]

can someone explain to me why the average of (0,13) = 6 , average of (0,5) = 2? thank you!

[@MichaelSambol]

Rounding down

[@nerfornada-]

THANK YOU

[@kafychannel]

thank you so much !

[@ZFlyingVLover]

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

[@folklore6270]

lifesaver

[@zea7452]

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

[@MichaelSambol]

The code returns the index/location of the element you're searching for: github.com/msambol/youtube/blob/master/search/binary_search.py.

[@maxheinwal5084]

if you return array[mid], you would return the number you are looking for, because mid is the index of the wanted number.

[@bossmusa9075]

thank you

[@VitorRaimundo1710]

👏👏

[@head-lag]

niceeee

[@kobey3044]

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

[@MichaelSambol]

It's by index in the array... so 0 and 13. See code here: github.com/msambol/dsa/blob/master/search/binary_search.py

[@kobey3044]

@@MichaelSambol Thank you!!! =)

[@luislambert6955]

𝓅𝓇𝑜𝓂𝑜𝓈𝓂 ✔️