Skip to content

binary-search.java #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions binary_search/src/easy/binary-search.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
import java.util.*;
import java.lang.*;
import java.io.*;
class Main {
public static void main(String[] args) {
int[] myarray = {5,8,10,13,21,23,25,43,54,75};
int key, location = -1;
System.out.println("The input array is");
for(int i=0;i<10;i++){ System.out.print(myarray[i]+" "); } System.out.println(); System.out.println("Enter the key to be searched"); Scanner sc = new Scanner(System.in); key = sc.nextInt(); location = binarySearch(myarray,0,9,key); if(location != -1) System.out.println("the location of the key is "+location); else System.out.println("Key not found"); } public static int binarySearch(int[] myarray, int beg, int end, int key) { int mid; if(end >= beg)
{
mid = (beg + end)/2;
if(myarray[mid] == key)
{
return mid+1;
}
else if(myarray[mid] < key)
{
return binarySearch(myarray,mid+1,end,key);
}
else
{
return binarySearch(myarray,beg,mid-1,key);
}

}
return -1;
}
}