JAVA小练习-二分查找法

public class BinarySearch {public static void main(String[] args) {// 需要注意的一点是，在进行Binary Search之前，要保证数组是有序的。int[] searchArray = {15,32,46,54,56,69,89};for(int i=0;i<searchArray.length;i++){int index = binarySearch(searchArray,searchArray[i]);System.out.println(searchArray[i]+"'s index : " + index);}}public static int binarySearch(int[] searchArray, int searchValue) {int min = 0;int max = searchArray.length-1;int mid = (max-min)/2;while (searchArray[mid]!=searchValue) {if (searchArray[mid]<searchValue) {min = mid +1;}else if(searchArray[mid]>searchValue){max = mid -1;}if(max<min){return -1;}mid =(max+min)/2;}return mid;}}