折半查找又称二分查找,前提是线性表中的记录必须是关键码有序(通常从小到大有序)
思路图解:
实现代码:
public class Test {
static int Binary_search(int[] a, int key) {
int low; // 定义最低位下标
int high; // 定义最高位下标
int mid; // 中间位
low = 0;
high = a.length - 1;
int count = 0;
while (low <= high) {
mid = (low + high) / 2;
if (key < a[mid]) {
high = mid - 1;
count++;
} else if (key > a[mid]) {
low = mid + 1;
count++;
} else {
System.out.println("count=" + count);
return mid;
}
}
return -1;
}
public static void main(String[] args) {
int a[] = new int[1000];
int key = 3;
for (int i = 1; i < 1000; i++) {
a[i] = i;
}
System.out.println(a[Binary_search(a, key)]);
}
}
输出结果:
count=9
3
经过九次查找到目标值3
接下来是插值插值,其最大的核心mid的计算改变了
代码:
public class Test {
static int Binary_search(int[] a, int key) {
int low; // 定义最低位下标
int high; // 定义最高位下标
int mid; // 中间位
low = 0;
high = a.length - 1;
int count = 0;
while (low <= high) {
mid = low+(high-low)*(key-a[low])/(a[high]-a[low]); //插值
if (key < a[mid]) {
high = mid - 1;
count++;
} else if (key > a[mid]) {
low = mid + 1;
count++;
} else {
System.out.println("count=" + count);
return mid;
}
}
return -1;
}
public static void main(String[] args) {
int a[] = new int[1000];
int key = 899;
for (int i = 1; i < 1000; i++) {
a[i] = i;
System.out.println(a[i]);
}
System.out.println(a[Binary_search(a, key)]);
}
}
结果:
count=0
899
直接就找到了,有点强
如果关键字分布比较均匀的查找表来说,插值查找算法的平均性能会比折半查找好得多,反之如果分布是比较极端不均匀的,用插值查找未必是很适合的选择。