Skip to content

Raghu #1

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.

Sign up for GitHub

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
Raghuu1 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Raghu #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
9 changes: 4 additions & 5 deletions java prog
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,29 +1,28 @@
import java.util.Scanner;

// Binary Search in Java

class Main {
int binarySearch(int array[], int element, int low, int high) {

// Repeat until the pointers low and high meet each other
while (low <= high) {

// get index of mid element
int mid = low + (high - low) / 2
int mid = low + (high - low) / 2;

// if element to be searched is the mid element
if (array[mid] == element)
return mid
return mid;

// if element is less than mid element
// search only the left side of mid
if (array[mid] < element)
low = mid + 1
low = mid + 1;

// if element is greater than mid element
// search only the right side of mid
else
high = mid - 1
high = mid - 1;
}

return -1;
Expand Down