Binary Search - Iterative Implementation and common errors

[@Supercool7042]

this channel is gold for data structures learners

[@russel_dev]

Best video ever could be on Binary Search !!!! Thanks a lot :)

[@michaelwood2292]

Thanks for the videos. I appreciate your time and knowledge....

[@jigarkapadiya1198]

logic at 8:58 how thorough he is with the algorithm...ONLY HE EXPLAINED WHY WE DO THIS

[@MrKaprson]

really nice... I´m kinda angry, because your alhorythm works really nicely, and contains less than 10 lines . My conained over fifty and still didn´t work :D ... But now it does. Truth is that sometimes you need to return not only one index, but a list of it, for there can be more than one possition with the given value. Keep up please, your vids are really educative and entertaining :)

[@brunomello6305]

I believe that binary search only considers the two possible questions: Is the element in the array? and if it is, what is the index of the first ocurrency of it?

[@sourav2726]

One of the best channel.and sir the way you teach is just awesome

[@moturulaxman3234]

Nice explanation,after watching this video I have the full idea of binary search, thank you so much

[@sourabhmazumdar2610]

GREAT VIDEO ON BINARY SEARCH SIR.

[@pranavganorkar2379]

Excellent Series on Binary Search.....

[@krishanudutta2943]

Excellent Explanation sir thanks a lot...

[@the3idiots787]

the last point is very benificial.

[@4w0ken]

dude i love u srsly.

[@jobayerrifad544]

u are a life saver!!

[@Kashif_Javaid]

very nice, keep it up, hope you can touch on circular buffer

[@095_shaniabalkhi9]

Awesome tutorial!

[@arthur6892]

You are the best.

[@narayankhatri6812]

Great tutorial... Thanks and hope more videos .... related

[@neverforget2556]

What I want to return multiple results that have the same variable? In iterative binary search

[@DanielSColao]

Great video!

[@sanketwalunj6580]

Which compiler is he using ?

[@crazy9780]

After watching the video I realized that you don't need to put {} in if statement with one execution

[@TheHarsh2318]

Will this work when 2 duplicate elements are stored in an array?

[@bhavyadesai6528]

Yes it will work, but it will return only the index of the first occurrence of that element in the array, as the main motive of binary search is to check whether an element is present in a given array or not... And if present, then at which index.

[@TheHarsh2318]

@@bhavyadesai6528 I asked this question 3 years ago.. funny.. you replied now😂😂

[@Nikhil-qi4oz]

@@TheHarsh2318 and I saw now, so funny

[@adarshkotali]

please add indexed sequential search

[@bcaignou4647]

i tried to compile online but it shows $gcc -o main *.c $main Enter a number the number 0 is not present in the array

[@Alohamora007]

Dude what's your name , i know codeschool , would like to know the dude behind this screen

[@sunnyraj2289]

Animesh Nayan

[@ravisinha1310]

@@sunnyraj2289 its so sad that this channel ended after tragic death of lord harshal

[@dominicanotacools1661]

Can I have the java file? I'm just a student.

[@anshumansingh9761]

I'd suggest you try to implement it on your own first :) You can obviously get the implementation from GeeksforGeeks.org afterwards.

[@tanaynarshana4056]

couldn't we just do (low/2+high/2) instead of low + (high-low)/2 ?

[@parasmahajan7741]

(3/2 + 7/2) would give (1+3)=4. 3+ (7-3)/2 would give 5. So this would give wrong result when both low and high are odd.

[@liquidmetal718]

we can just right shift.

[@ahmidahmid9303]

if low 0 you cant divide by zero