Binary Search For a Reverse Sorted Array
Sat Jan 29 2022 10:16:00 GMT+0000 (Coordinated Universal Time)
Saved by
@Namrata63
import java.util.*;
class BinarySearch
{
int binarySearch(int arr[], int start, int end, int x)
{
if(end>=start)
{
int mid = start+(end-start)/2;
if(arr[mid]==x)
return mid;
else if(arr[mid]<x)
return binarySearch(arr, start, mid - 1, x);
else if(arr[mid]>x)
return binarySearch(arr, mid+1, end, x);
}
return -1;
}
public static void main(String[] args)
{
BinarySearch s = new BinarySearch();
int arr[] = {72, 63, 55, 47, 37, 22, 15, 1};
int n = arr.length;
int x = 22;
int result = s.binarySearch(arr, 0, n - 1, x);
if(result == -1)
System.out.println("Element not Found");
else
System.out.println("Element Found at index = " + result);
}
}
content_copyCOPY
Comments