public
class
A{
public static void main (String [] args)
{
int arr[] = { 1 , 2 , 5 , 6 , 8 , 9 , 56 , 84 };
int i = 56 ;
print(arr);
System.out.println(binarySearch(arr,i));
}
public static void print( int arr[]){
for ( int k = 0 ;k < arr.length ;k ++ )
{
System.out.print(arr[k] + " " );
}
System.out.println();
}
public static int binarySearch( int arr[], int i){
int starPos = 0 ;
int endPos = arr.length - 1 ;
int mid = (starPos + endPos) / 2 ;
if (arr.length == 0 )
{
return - 1 ;
}
while (starPos < = endPos){
if (i == arr[mid]){
return mid;
}
if (i > arr[mid]){
starPos = mid + 1 ;
}
if (i < arr[mid]){
endPos = mid - 1 ;
}
mid = (starPos + endPos) / 2 ;
}
return - 1 ;
}
}
public static void main (String [] args)
{
int arr[] = { 1 , 2 , 5 , 6 , 8 , 9 , 56 , 84 };
int i = 56 ;
print(arr);
System.out.println(binarySearch(arr,i));
}
public static void print( int arr[]){
for ( int k = 0 ;k < arr.length ;k ++ )
{
System.out.print(arr[k] + " " );
}
System.out.println();
}
public static int binarySearch( int arr[], int i){
int starPos = 0 ;
int endPos = arr.length - 1 ;
int mid = (starPos + endPos) / 2 ;
if (arr.length == 0 )
{
return - 1 ;
}
while (starPos < = endPos){
if (i == arr[mid]){
return mid;
}
if (i > arr[mid]){
starPos = mid + 1 ;
}
if (i < arr[mid]){
endPos = mid - 1 ;
}
mid = (starPos + endPos) / 2 ;
}
return - 1 ;
}
}