二分查找
二分查找也称折半查找(Binary Search),它是一种效率较高的查找方法。但是,折半查找要求线性表必须采用顺序存储结构,而且表中元素按关键字有序排列。
二分查找原理
1. 设置查找区间:left = 0;right= len;
2. 若查找区间[left, right]不存在,则查找失败;否则转步骤3
3. 取中间位mid = (left + right) / 2;比较 target 与 arr[mid],三种情况:
3.1 若 target < arr[mid],则right = mid - 1;查找左半区间,转2;
3.2 若 target > arr[mid],则left = mid + 1;查找右半区间,转2;
3.3 若 target = arr[mid],则查找成功,返回 mid 值;
代码实现
非递归
int Search(int arr[], int len, int target) {
int left = 0;
int right = len;
int mid = 0;
while (left <= right) {
mid = (left + right) / 2;
if (target < arr[mid]) {
right = mid - 1;
}else if (target > arr[mid]) {
left = mid + 1;
}else {
return mid;
}
}
return -1;
}
递归
int Search(int arr[], int left, int right, int target) {
if (left > right) return -1;
else {
int mid = (left + right) / 2;
if (target < arr[mid]) {
return Search(arr, left, mid - 1, target);
}else if (target > arr[mid]) {
return Search(arr, mid + 1, right, target);
}else {
return mid;
}
}
}