Skip to content

Create MetaBinarySearch.java #6033

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

Closed
wants to merge 1 commit into from
Closed
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
37 changes: 37 additions & 0 deletions MetaBinarySearch.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
import java.util.Scanner;

public class MetaBinarySearch {
public static int metaBinarySearch(int[] arr, int target) {
int left = 0, right = arr.length;

while (left < right) {
int mid = left + (right - left) / 2;
if (arr[mid] < target)
{
left = mid + 1;
} else right = mid;
}
if (left == arr.length) return -1;
return arr[left];
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter number of elements: ");
int n = sc.nextInt();
int[] arr = new int[n];

System.out.println("Enter the sorted elements:");
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
System.out.print("Enter the target value: ");
int target = sc.nextInt();
int result = metaBinarySearch(arr, target);
if (result == -1) {
System.out.println("No element found that is greater than or equal to " + target);
} else {
System.out.println("The smallest element >= " + target + " is " + result);
}
}
}
Loading