| java 这篇文章主要是做一下Java的查询算法的整理,xXx 二分法查找 1234567891011121314151617 int BinarySearch1(int a[], int value, int n){ int low, high, mid; low = 0; high = n-1; while(low<=high) { mid = (low+high)/2; if(a[mid]==value) return mid; if(a[mid]>value) high = mid-1; if(a[mid]<value) low = mid+1; } return -1;} 二分法查找(递归) 12345678910 int BinarySearch2(int a[], int value, int low, int high){ int mid = low+(high-low)/2; if(a[mid]==value) return mid; if(a[mid]>value) return BinarySearch2(a, value, low, mid-1); if(a[mid]<value) return BinarySearch2(a, value, mid+1, high);} 赞微海报分享
近期评论