Introduction to Binary Search (Data Structures & Algorithms #10)

Here’s my introduction to the binary search algorithm.

[CSDojo]

If you’re already familiar with binary search, I’d recommend the practice problem I introduced at 12:17.

[tylerdurden]

Continue this series of data structures.

[adibattie]

It's not obvious how much binary search helps until you actually code it and time it yourself. It's actually amazing. Thanks for the informative videos!

[prernacore]

please continue this course. it's the best that I have ever stumbled upon. Been watching all the videos since morning and I am so grateful for these, cleared all the doubts and making basics easier and clear. Thank you!

[ctcrnitv]

You are such a good teacher. I already knew what binary search was but this was brilliantly explained, probably the clearest explanation I've ever seen.

[manuelelkess]

This course of data structures and algorithms one of the best on the internet I really hope you continue it to the very end.

[Veigaburame]

the way you seperate exercise into 10-15 minutes is pretty handy. I could spend time watching your video while having lunch. Love to see these kind of videos uploaded on Youtube. Thanks Dojo hehee

[TheNaderpop]

Man, how do I love your introduction to this series so much
,
I hope you finish this series as soon as possible.

[dreamofmirrorsguy]

You are insanely the best pragmatic youtuber and teacher I've watched so far. Thank you very much for your content!

[dailycodingproblem]

I’m 4 days away from turning 93 and CS Dojo inspired me to create my own tutorials. Thanks, CS Dojo!

[williambasquez]

Back at it again with the good stuff 👨🏻‍💻💻

[samuraijack]

I'm not gonna lie, it is still hard to wrap my head around some of this stuff like time complexity and Big O.

Thank you for all that you do!

[asdfractal]

The way you explain the process of thinking about the problem is really good. While you are explaining the problem I can already imagine the code required to solve it. Your videos have helped me a lot to conceptualize solutions to my problems.. so thank you very much!

[shokhrukhbekyursunjonov]

That's so cool, learned a lot. I, myself, for example solved it like following:
def search(arr, target):
if target in arr:
for i in arr:
if arr[i]==target:
return i

print(search([1, 2, 3, 11], 11))

output: 3

[mattoattacko]

Heck yeah! You totally came through. Much appreciated mate!

[lucyledezma]

Hello CS Dojo!!!. I am so happy for the new video!!!

[SarangDhanurdhari]

Thanks a lot dojo. Please keep continuing this series.

[rajibdpi]

Thank you so much for this great opportunity to Learn Dara structures and Algorithm with you.

[cpbeatzx]

This is no joke one of the best videos ive watched, I do not comment on youtube videos, but this deserves one.
Thank you

[tylerxiao]

My idea for shifted binary search: Copy the array once, so that an array like [3, 1, 2] becomes [3, 1, 2, 3, 1, 2]. Next, we compute the maximum and minimum values of our original array, which are 3 and 1, respectively. Then, we run 2 pointers to find the indices of the range between the minimum and maximum, which in our example the indices are 1 and 3, and we binary search through those values.