二分查找是针对有序序列来说的,在有序序列中使用二分查找能大大提高查找效率,这里记录一下二分查找的递归和非递归写法。
非递归写法:
public int binarySearch(int[] a, int target) {
int len = a.length;
if(len == 0)
return -1;
int low = 0,high = len-1;
while(low <= high) {
int mid = low + (high - low) / 2;
if(a[mid] == target)
return mid;
else if(a[mid] > target)
high = mid - 1;
else
low = mid + 1;
}
return -1;
}
递归写法:
public int binarySearch(int[] a, int start, int end, int target) {
if(start > end)
return -1;
int mid = start + (end - start) / 2;
if(a[mid] == target)
return mid;
else if(a[mid] > target)
return binarySearch(a, start, mid-1, target);
else
return binarySearch(a, mid+1, end, target);
}
同样,在二叉排序树(也叫二叉查找树)中查找一个元素也存在递归和非递归的写法,这个会在下一篇博客中记录。