import java.util.Arrays; public class Main{ // binary search = Search algorithm that finds the position // of a target value within a sorted array. // Half of the array is eliminated during each "step" public static void main(String[] args) { int array[] = new int[1000000]; int target = 777777; for(int i = 0; i < array.length; i++) { array[i] = i; } //int index = Arrays.binarySearch(array, target); int index = binarySearch(array, target); if(index == -1) { System.out.println(target + " not found"); } else { System.out.println("Element found at: " + index); } } private static int binarySearch(int[] array, int target) { int low = 0; int high = array.length - 1; while(low target) high = middle - 1; else return middle; //target found } return -1; } }

I cannot believe how simple you made this. Every other video I saw eventually caused confusion. You clearly stated the concept first, where every thing that followed fell into place. This has been my experience in your other videos learning C#, and Python programming languages. God Bless You.

U are a god. I have used your tutorials since I started programming in april 2022... You have no idea how much you have helped me out man!! all for free!!!!

Had a task with binary search. Didn't understand -> open Bro Code Data Structures and Algorithms Playlist -> Found Binary Search -> Understood :D

this was actually really nice. itd be nice if you had even more stuff on datastructures and algos so i can become an algo chad

I hope that you can do some tutorials about every data Structure or techniques... I love they way you teach

You are underrated af

commenting for the algorithm love your stuff my guy 👍

am officially done with "programming" but I will keep my subscription ❤

Thanks a lot friend! The first explanation is great! I am normally c# user but can easily follow your tuts since its similar. What i cant understand is how while loops is going to break, for example when start is greater end in that situation.

Thank you so much for making such a great content

This example gave me a much better understanding of how searching works.

You do an outstanding job of making the content easy to understand. You have helped me get through my class this quarter thank you!

Hey, bro. I just wanted to let you know that when it comes to teaching and explaining code, you are the best of this world. I am not exaggerating; I have watched hundreds of channels, and taken tens of paid online courses, no one is as nearly as good as you.

You saved the day, AGAIN ! Thanks so much bro, take care of you ! :)

A hi from "Brazil' Bro, code! You are the guy.

this channel should have more than a million subscribers!!!

Thank you so much Lord Bro Code. I was able to finish my Java final semester project thanks to you sir.

Very well explained. Simple and understandable!

Your way of teaching is just fantastic bro🤩. You are the best. Love from India❤

Great explanation, thanks a lot!!

You are the best!💻

well, you're an absolute legend that's all I got to say

Great video, thanks bro.

Bro you are genus !😍😍😍

thank you. Your video helped a lot.

Amazing video bro, Thank You so much.

Here I was over complicating it in my head thank you!

Nice and clear as always.

Nice tutorial

Well done, thank you a lot bro.

good job bro....!

Thank you, bro code! Excelent explaining.

Thanks bro, this is awesome

Thank you. Such a helpful video

Underrated. Could you make one on Ternary Search Tree, Hashing (like double hashing), string search,MSD radix sort, RB trees. in your playlist. Would appreciate it

Better than any movie.

thank you!

thank you so much!

this was helpful thank you

Awesome!

You Know One Thing!..... You Are My Bro.....

Thank you!

Great methodology 🎉 thx

Thank you, sir 👍👍👍

go super Bro!

Love it!

Thanks!

So much knowledge

Dude is the GOAT fr

Thank you.

good one bro!

Great vid

Thanks, Bro!

Thanks bro *ongoing comment crusade while i cram*

Wow nice channel bro❤

Thanks

So underrated....Bro keep goin❤... I know u hate it but waiting for ur OP android app development lol

Nice class

thanks a lot)

thanku sir

... can you literally just teach me everything, math / science / life..... lol you vids are so clear and easy to understand

Love your video it is really great. How would you do a binary search if the array was filled with like 3 digit hex codes or some string similar to that? Like the first one would be AAA and the second would be AAB. Would I need to convert them to some number?

what a legend ,watched his vid 5 days b4 exam and got a 97/100

shout out from South Korea

BEST!

Jesus Christ, how such a great content is such an underrated... Horrifically underrated. P. S. : this English... I'VE BEEN WAITING FOR THE NON INDIAN CODE CONTENT FOR A YEARS...

thx

Nice

This is essentially how you troubleshoot ground faults in a fire alarm notification circuit - split the circuit in the middle and look for the short to ground on either end (hopefully you don't find a short to ground on both ends).

good explanation but explain the while loop part too and why we are using middle +1 and middle -1 for effective understanding

Please also solve some leetcode problems

Hey bro, please make video of react js or angular 🤩

We had to implement a binary search algorythm in the past semester in practical informatics. It wasn't really hard but I still ask myself if it is really used in the world or was it just a simple mind exercise to prep us for the whole algorythms and data structures shtick? I mean the code looks and works so simple, it just seems... I don't know, too simple.

it would be nice a recursive explanation also.

it is a good video, nice, i like it papa

u r awesome

cool

I love your videos, they are very helpful and easy to grasp. But I must admit my OCD gets triggered when you don't put your else on the same line as the closing curly brace of the respective if... xD

Ha nice 👍🏿

bro code is bro god after this

👍

❤

gucci gang gucci gang gucci gang gucci gang gucci gang gucci gang

Ehhhh Mazing

♥

why everyone finds middle with complex formula, instead of (low+high)/2, while both give same result???

Hey. Does this actually work for the highest value? If target is at position arr.length -1 will it find it? Because i tried implementing it and for that particular case it didn't work (returned -1. I probrably have some mistake though but thought of asking too).

Hi bro, I still don't understand why we don't simply calculate middle like this : (high + low ) / 2 , since we are talking about indices than we won't face an overflow issue right ?

Great, but this only works for numbers. In a situation where one would need to search an array of strings, you'd have to compare the middle value to the search query/target like so: x = query.compareTo(middleValue); if (x > 0) { minIndex = middleIndex + 1; } else if (x < 0) { maxIndex = middleIndex - 1; } else { return middleIndex; }

I like all your videos. can I ask why must int high =array.length-1 ? what is the need to -1 ? Hope you can explain how does it affect the result, thank you.

fellow bro

is this method usable to unsorted array?

6:13 Why not (high+low)/2 so average of two elements is the middle? Im not saying your is wrong, just it feels weird.

Face reveal on 100k ?

Feriduussssssss

Help the yt algorithm

$ey bro

Do you think you can help me with my javafx project? I can pay you please! I need to implement a searchbar on a tableview I got from input

yo, random comment