重学java之随即数组二分查找

import java.util.Arrays;

public class Binarysearch {

public static int binarysrch(int[] a,int value){

int low=0;

int hight=a.length-1;

int midd=0;

while(low<=hight){

midd=(low+hight)/2;

if(value==a[midd]){

System.out.println("查找成功，在第"+midd+"个位置！");

return a[midd];

}

if(value<a[midd]){

hight=midd-1;

}

if(value>a[midd]){

low=midd+1;

}

}

System.out.println("查找不成功！");

return -1;

}

public static void main(String args[]){

int[] array=new int[50];

int value=25;

for(int i=0;i<array.length;i++){

int numb=(int)(Math.random()*100);

array[i]=numb;

}

Arrays.sort(array);

System.out.println(binarysrch(array,value));

for(int i=0;i<array.length;i++){

System.out.print(array[i]+" ");

}

}

}