Binary Search - Recursive implementation

[@leoniduvarov6565]

I cant put into words how helpful this was. Keep it up!!

[@mycodeschool]

You're welcome Aaron !!

[@jeanphilius7500]

Great explanation Animesh! If anyone is confused by why Animesh switched to formula mid = (high - low)/2 + low 1:04 Here's how I was able to wrap my head around it. lets PRETEND anything over 10 causes an OverFlowException. We will set low and high arbitrarily to 4 and 8 respectively (e.g., low = 4, high = 8). Therefore, in our contrived example, if we sum low + high we get an OverFlowException, because 4 + 8 = 12 which is greater than 10 (the highest number we can handle before overflowing). This is why using formula mid = (high + low) /2 breaks down. A more robust formula would be mid = (high - low)/2 + low .... And if we plug in values from our contrived example to calculate mid = (high-low)/2 + low = (8-4)/2 + 4 = 6 we see that it gives us the same answer as mid= (high + low)/2 = (8+4)/2 = 6 but without causing an OverFlowException!

[@spacetime_wanderer]

Good example. I would initially prefer 'mid = floor((high/2) + (low/2));' at least till I remember low + (high-low)/2. The disadvantage in my way I feel is division is slightly more costly than addition and subtraction - and I am doing that twice.

[@cheems08213]

thank you

[@SaurabhMishra0709]

Thanks for the explanation J Phillius

[@095_shaniabalkhi9]

Thanks bruh!

[@kainatmalik1752]

thank you so much, sir, for your easy and such attractive way of teaching, I never feel bore during listening to your lecture.

[@manuelconte623]

this video was since 2013 and in 2021 this still good!!!

[@agniveshadhikari]

Crystal clear explanation

[@AllRounder-q9g]

My man you are so convincing, truely amazing......

[@miguelangelguzmansanchez6286]

you´re da fuckin bomb dude, ¡viva la indiaaaaa!

[@nagenHARP]

farrrrrrrrrrrr better than current channels .

[@muneerahmad5545]

Very good bhaiya easily explained very good.keep it up

[@ShekharKumar-tn9rl]

I know You are no More Sir But seriously I am saying a big thanks to you I haven't found any teacher like you till date you are best of all time sir 🙂 Nation needs Teacher Like You Sir RIP OM Shanti

[@hamiltonian450]

thanks for the tutorial it helped a lot keep up the great work!!

[@harryy000]

Question though.For the -1 case meaning when the element is not present in the array since the array is sorted and we know the size of the array,would it not be wiser to initially check if the element we are searching for is gt the size of the array or less than the value in the minimum index(arraypos[0]).Won't this be more effective than doing a if low > high then return -1 which will only be true after completing a recursive/iterative exhaustion of the array?

[@nafisfaiyaz7543]

no, because the key we are searching for can be inside the range of the lowest and highest elements in the arrey and still not present in the arrey. so, if you check only for lowest and highest elements, chances are you will not find the -1 case

[@scienceisinaccordancewithi3688]

YOUR VIDEOS ARE REALLY AWESOME SIR THANKYOU VERY MUCH KEEP UP THE GOOD WORK

[@095_shaniabalkhi9]

Great tutorial. Thanks!

[@adityaroshanpatro9861]

why does that -1 return to its previous one till the top ?? 7:41

[@utpalbandyopadhyay1633]

Great explanation ......!!😊👍

[@SoundscapesbyPritam]

Why not u have used "while loop" as a base condition in recursive approach? will it be true if we use "while" instead of "if" as the base condition?

[@lekanosagie]

+Pritam Why use recursion if you're still planning on using loops?

[@unboxwithaakash]

if loops were to use in recursion then program would gud if remain iterative itself.

[@ishaankulkarni49]

Thanks you so much for making this!!!

[@krishanudutta2943]

Thanks a lot sir for this amazing lecture...

[@chinmayrath8494]

Best explanation. Thanks a lot !

[@abhinavtyagi1657]

why do we need return keyword inside our if and else if statements ?? Bcoz even if we don't return, we still calling the same function i.e. making our recursive call.

[@JuanRodriguez-fk2iy]

Hello! Amazing video!! I wanted to ask, which method takes less memory? I am still having trouble understanding how recursive functions use memory. Thank you!

[@075_ritikkumar7]

Hey bro. Watch his videos under the playlist recursion. I am sure your doubts would be cleared.

[@shaikshabbir4479]

can we also exit when low == high ?

[@rohanmahajan3436]

when low == high, then we have to check if A[mid] == x. If that holds true, then we would return mid. Otherwise, if that is false, we return -1. This is still correct, just another way to code it.

[@ankitthakar2671]

We should avoid recursion because sometimes it takes lots of stack space. specifically if you are working in the domain where performance factor is the key.. Your videos are really good.

[@sangeethapratapan1904]

thank you Sir. It helped me a lot.

[@mhm5162]

superb,,good job

[@real_manikant]

Sir , what is the Space complexity of Binary search in the recursive implementation ????????????? I think it should be O(1) but many people argue that its O(log n)............. Please reply soon

[@gluck91]

O(1) is constant and you do not find solution in one method call, so in this case is O(log) because every time you call method you divide the problem in 2.

[@jahnaviization]

Can you please do a tutorial on binary search using pointers on a list of names?

[@gluck91]

Good video but not every recursion method can be written in an iterative method, for example : Hanoi Tower problem

[@gabriellashebly]

what does the arrow mean?

[@AnilKumar-jp1cu]

Thank you so much......vary nice approach

[@amarvishwakarma9173]

great explanation bro

[@MexicanRmz]

Thanks bro, great explanation.

[@hitrahulmehta]

beautifully explained! thanks a lot!

[@whiskybhoot]

OH WOW

[@strawbebbie5]

so helpful! thanks!

[@qwe123727]

In your code, Is this correct? mid = low + (high-low)/2;

[@ankits386]

it is correct ..if u just take tee L.C.M. the value of mid = (low+high)/2 .. mid = low + (high-low)/2 mid= (2low + high -low)/2 mid= (low + high)/2

[@tenzin8773]

Thank you sir!!

[@ramankr0022]

very helpful.

[@pratikshinde3402]

start at 3:00

[@keshavmaheshwari521]

how can low be greater than high

[@Manish-dh8gx]

When we don't find the item in the array our loop increments this happens - (low and high are on same index ) and for loop increments the low by 1

[@brunocardoso8277]

Thank you man!

[@AnonymousDev1]

I'm a sensitive man . I see recursive function; I panic ! 😵‍💫

[@soulasscape]

sir why do we write return with every if else case, we want to sub divide the array and call it recursively so cant we write bs(a,x,mid+1,end) instead of return bs(a,x,mid+1,end) ? i am not able to understand why we write return statement with every recursive call made kindly explain

[@yahyashaikhworld]

Thanks , but iterative is easier to write

[@saidbarke6363]

thank you.

[@Crywolf203]

thanks!!!

[@kshitijvengurlekar1192]

Thanks

[@vaishnavi5070]

please do this using pointers

[@RAHUL-gf3ft]

Jai IIIT ALLAHABAD

[@himanshu2487]

please speak in your natural tone its array not aare its very irritating btw its very help video to me

[@siddharthadas86]

you are an idiot.

[@mithujana7241]

SHUT UP