public static void binarySearch(int []Array,int value,int start,int end)
{
int middle=0;
while(true)
{
middle=(start+end)/2;
if( start>end){
System.out.println("Not found");
break;}
else if(Array[middle]>value){
start=middle;}
else{
end=middle;}
}
No comments:
Post a Comment