二分查找時間複雜度分析

int[] a={1,2,3,3,4,6,7,8}; int key=1,low=0,high=a.length-1; while (low<=high){ int middle=(low+high)/2; if (key==a[middle]){ System.out.println

>>阅读原文<<