二分法查找算法的java实现 - Java / Java SE

Java code:

package TestErfenCha;


public class TestErfenCha {
public static void search(int shu, int[] arr){
int len = arr.length-1;
int min = 0, max = len, mid = (max-min)/2;
int count = 2;
while(shu!=arr[mid]){

if(shu<arr[mid]){
min = min;
max = mid-1;
mid = min+(max-min)/2;
System.out.println("第"+count+"次的最小值是："+arr[min]);
System.out.println("第"+count+"次的中间是："+arr[mid]);
System.out.println("第"+count+"次的最大值是："+arr[max]);
}
else if(shu>arr[mid]){
min = mid+1;
max = max;
mid = min+(max-min)/2;
System.out.println("第"+count+"次的最小值是："+arr[min]);
System.out.println("第"+count+"次的中间是："+arr[mid]);
System.out.println("第"+count+"次的最大值是："+arr[max]);
}

if(shu==arr[mid]){
System.out.println("恭喜你找到元素");
break;

}
count++;

}
}