二分查找

public class binarySearch {public int find(long searchKey) {int [] a = {9,8,7,6,5,4,3,2,1};int nElems = 9;int lowerBound = 0;int upperBound = nElems - 1;int curIn;while(true) {curIn = (lowerBound + upperBound);if (a[curIn] == searchKey) {return curIn;}else if (lowerBound > upperBound) {return -1;} else {if (a[curIn] > searchKey)curIn = lowerBound + 1;elsecurIn = upperBound - 1;}}}}