折半查找的前提条件是需要有序表顺序存储,对于静态查找表,一次排序后不再变化,折半查找能得到不错的效率。但对于需要频繁执行插入或删除操作的数据集来说,维护有序的排序会带来不小的工作量,那就不建议使用。
复杂度分析:最坏情况下,关键词比较次数为log2(n+1),且期望时间复杂度为O(log2n);
1.递归查找
public static int binarySearch(int[] array, int v, int start, int end) {
if (array == null) throw new NullPointerException("数组为空");
if (array[start] == v) return start;
if (array[end] == v) return end;
//递归查询
int midInd = (start + end + 1) / 2;
if (array[midInd] == v) {
return midInd;
} else if (array[midInd] > v) {
return binarySearch(array, v, start, midInd - 1);
} else {
return binarySearch(array, v, midInd + 1, end);
}
}
public static void main(String[] args) {
int[] array = new int[]{1, 2, 4, 5};
int a = binarySearch(array, 4, 0, array.length - 1);
System.out.println("binarySearch1001->a:" + a);
}
2.循环查找
public static int binarySearch(int[] array, int v) {
int start = 0, end = array.length - 1, mid = 0;
while (start < end) {
if (array[start] == v) return start;
if (array[end] == v) return end;
mid = (start + end + 1) / 2;
if (array[mid] == v) {
break;
} else if (array[mid] > v) {
end = mid - 1;
} else {
start = mid + 1;
}
}
return mid;
}
public static void main(String[] args) {
int[] array = new int[]{1, 2, 4, 5};
int a = binarySearch(array, 4);
System.out.println("binarySearch1001->a:" + a);
}