Binary Search Algorithm in C#

[@MilanJovanovicTech]

Get the source code for this video for FREE → the-dotnet-weekly.ck.page/binary-search Want to master Clean Architecture? Go here: bit.ly/3PupkOJ Want to unlock Modular Monoliths? Go here: bit.ly/3SXlzSth

[@AslamNazeerShaikh]

Please make full DSA series in c# ❤🎉

[@MilanJovanovicTech]

Maybe, maybe

[@MohammedMufish_Shaikh]

​@@MilanJovanovicTech please say might be

[@17Kalash]

@@MilanJovanovicTechit will be a blessing a DSA Course in C# by you ✨🙏🏼

[@genadyshmunik6041]

@@MilanJovanovicTechdeep and extensive, I will buy one for sure!

[@GiorgiChikovani_FromGeorgia]

@@MilanJovanovicTech +1 Let's do it

[@lalithmahadev5027]

So,you basically binary searched to the chapter of the book where you have contributed.Nicely done Milan!!!

[@MilanJovanovicTech]

I was the Tech editor 😅 But the writing is all Dino.

[@fredericmerouze4876]

great video milan :) ! it's possible to have more content about Algorithm (binary tree etc) ?

[@MilanJovanovicTech]

Yes, definitely

[@nouchance]

Thank you MILAN!

[@MilanJovanovicTech]

Sure thing :)

[@meharshahbaz2715]

Very conceptual video

[@MilanJovanovicTech]

Thanks!

[@10Totti]

Dino Esposito and Francesco Balena top software developer!!!!

[@MilanJovanovicTech]

Great guys!

[@glickyaron9490]

great video. If it is possible to store the data in hash table. it will give a search complexity of O(1).

[@MilanJovanovicTech]

Yes, it's possible

[@orestpavlenko565]

Did you install some extension colors for intellisense or it could be setup in Visual Studio?

[@MilanJovanovicTech]

ReSharper

[@r75shell]

Have you really tried to benchmark recursive version? Because if C# has tail-recursion optimization, it should produce same code as while loop implementation.

[@MilanJovanovicTech]

Haven't tried the recursive approach

[@CLeovison]

Hi Milan, I hope that you will release a video on how start making an minimal api in the future. Thank you thank you so much

[@MilanJovanovicTech]

Noted!

[@dhruvmathur5315]

Hey Milan, awesome stuff as always, can you please make a video on Durable functions please, I saw your video on azure functions and I think that's the next step no ?

[@MilanJovanovicTech]

Noted

[@ЛюбомирГеоргиев-о5й]

Hi Milan, you have a bug in the Binary search code. This bug is very sneaky and widely speeded. Imagine input collection is with 2_000_000 elements and you are looking for the last element (or in upper part). When you sum left and right boundary the mid will overflow. There is very simple workaround using (right - left boundary) /2

[@MilanJovanovicTech]

@@ЛюбомирГеоргиев-о5й mentioned it in the benchmark part

[@usEr-oCt-76]

But sorting is also part of the search which saves the time of the actual search.

[@MilanJovanovicTech]

Sort while inserting

[@krccmsitp2884]

I would've guessed that the compiler is clever enough to optimize / 2 to >> 1. Apparently it wasn't.

[@MilanJovanovicTech]

Explanation: x.com/andersforsgren/status/1827796305944416568

[@michaldivismusic]

I'm guessing bit shift operations are scary for some people which might by why the compiler doesn't suggest this.

[@enricoroselino7557]

yessss DSA

[@MilanJovanovicTech]

Should I do more?

[@enricoroselino7557]

@@MilanJovanovicTech yesss bring back the nightmare on BFS DFS or somesort, promise will takcle em this time 😂

[@sunzhang-d9v]

arr.for what is tool?

[@MilanJovanovicTech]

What?

[@henrik3098]

nice :)

[@MilanJovanovicTech]

Thanks!

[@onaspnet]

Your video thumbnail has a bug ... mid point is wrong ....

[@MilanJovanovicTech]

Oh no

[@shoooozzzz]

YAAC (Yet another algo channel)

[@MilanJovanovicTech]

Is that a term? First time I see it

[@fabaladibbasey7453]

way to DSA

[@MilanJovanovicTech]

Thank you 💪

[@haroldpepete]

12:17 45 is greater than 40

[@MilanJovanovicTech]

It is