二分法

public class Test {

public static void main(String[] args) {

int[] intArr = {1,2,4,6,8,8,12,13,15,17,22,33,44,55,66,77,88};

List<Integer> intList = new ArrayList<Integer>();

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

intList.add(intArr[i]);

}

int result = binarySearch(intList,22);

System.out.println(result);

}

public static int binarySearch(List<Integer> list,int item) {

int low = 0,high = list.size() - 1, mid = 0;

while(low < high) {

mid = (low + high) / 2;

if(item == list.get(mid))

return list.get(mid);

if(item > list.get(mid))

low = mid + 1;

if(item < list.get(mid))

high = mid - 1;

}

return 0;

}

}