Binary Search
import java.util.*;
class binary{
public static void main(String[] args) {
int arr[]={2,5,7,8,20};
int len=arr.length;
int start=0;
int end=len-1;
int key =-1;
while(start<=end){
int mid = start+end/2;
if(key<arr[mid]){
end=mid-1;
}
if(key==arr[mid]){
System.out.println("key found at position "+mid);
break;
}
if(key>arr[mid]){
start=mid+1;
}
else{
System.out.println("key not found");
break;
}
}
}
}
Comments
Post a Comment