java 二分查找实现

public class BinaryChop { private int a[]; private int nElements ; public int find(int searchKey){ int lower = 0; int upper = nElements -1; int curIn; while(true){ curIn = (lower + upper)/2; i

>>阅读原文<<