package Test;
public class Test8 {
/**
* 二分查找
*/
public static final void testTwoPointSearch() {
int[] source = new int[] { 1,13,21,35,39,51,62,78,99 };
System.out.println(twoPointSearch(source, 22));
System.out.println(twoPointSearch(source, 21));
System.out.println(twoPointSearch(source, 1));
System.out.println(twoPointSearch(source, 99));
System.out.println(twoPointSearchByRecursion(source, 22, 0, source.length-1));
System.out.println(twoPointSearchByRecursion(source, 21, 0, source.length-1));
System.out.println(twoPointSearchByRecursion(source, 1, 0, source.length-1));
System.out.println(twoPointSearchByRecursion(source, 99, 0, source.length-1));
}
/**
*
* @param source
* @param search
* @return 返回匹配的下标
*/
public static final int twoPointSearch(int[] source, int search) {
int min = 0;
int max = source.length - 1;
int mid = ( max - min ) >> 1 ;
while (mid >= 0 && mid <= max && max >= min) {
if(source[mid] == search ) {
return mid;
}
if(source[mid] > search ) { // 在souce前半部分查找
max = mid - 1;
} else { // 在souce后半部分查找
min = mid + 1;
}
mid = ((max-min) >> 1) + min ;
}
return -1;
}
/**
* 二分查找,递归版本
* @param source 有序数组
* @param search 待查询元素
* @param min 开始下标
* @param max 结束下标(初始值为有序数组长度减1)
* @return
*/
public static final int twoPointSearchByRecursion(int[] source, int search, int min, int max) {
int mid = ((max-min) >> 1) + min ;
if(mid >= 0 && mid <= max && max >= min ) {
if(source[mid] == search ) {
return mid; //返回下标
}
if(source[mid] > search ) { // 在souce前半部分查找
max = mid - 1;
} else { // 在souce后半部分查找
min = mid + 1;
}
return twoPointSearchByRecursion(source, search, min, max) ;
} //否则结束递归
return -1;
}
}
二分查找算法java版实现(递归实现与非递归实现)
最新推荐文章于 2024-03-06 09:24:27 发布