anginerad的博客

原创 二分法查询（某个网站的面试题）

public class BiSearchTest { // 非递归 public static int BiSearchNonRecursive (int Array[], int low, int length, int key) { int high = length - 1; while(low<=high){ int half = (low+high)