二分查找是最简单的查找,本科阶段数据结构就应该学好的,现在来炒剩饭,重打基础。
二分查找,必须是有序的,如果数组不是有序,则先排序,再查找。
递归的二分查找是均分的,每次用中心点与目标值比较,再递归操作。
递归的代码如下:
package Collection;
public class BinarySearch {
/**
* 使用递归的二分查找(递归的均分折半)
*title:recursionBinarySearch
*@param arr 有序数组
*@param key 待查找关键字
*@return 找到的位置
*/
public static int recursionBinarySearch(int[] arr,int key,int low,int high){
if(key < arr[low] || key > arr[high] || low > high){
return -1;
}
int middle = (low + high) / 2; //初始中间位置
if(arr[middle] > key){
//比关键字大则关键字在左区域
return recursionBinarySearch(arr, key, low, middle - 1);
}else if(arr[middle] < key){
//比关键字小则关键字在右区域
return recursionBinarySearch(arr, key, middle + 1, high);
}else {
return middle;
}
}
public static void main(String[] args) {
int[] arr = {1,3,5,7,9,11};
int key = 7;
int position = recursionBinarySearch(arr, key,0,arr.length-1);
if(position == -1){
System.out.println("查找的是"+key+",序列中没有该数!");
}else{
System.out.println("查找的是"+key+",找到位置为:"+position);
}
}
}
非递归的如下:
public class BinarySearch{
/**
* 不使用递归的二分查找
*title:commonBinarySearch
*@param arr
*@param key
*@return 关键字位置
*/
public static int CommonBinarySearch(int[] arr,int key){
int low = 0;
int high = arr.length - 1;
int middle = 0; //定义middle
if(key < arr[low] || key > arr[high] || low > high){
return -1;
}
while(low <= high){
middle = (low + high) / 2;
if(arr[middle] > key){
//目标key值比中间数小,在左边
high = middle - 1;
}else if(arr[middle] < key){
//目标key值比中间值大,在右边
low = middle + 1;
}else{
return middle;
}
}
return -1; //最后仍然没有找到,则返回-1
}
public static void main(String[] args) {
int[] arr ={1,3,4,6,7,9,10};
int num = CommonBinarySearch(arr,9);
if (num == -1){
System.out.println("没找到");
}else {
System.out.println("找到了,位置为"+num);
}
}
}
参考文献:https://blog.csdn.net/maoyuanming0806/article/details/78176957