二分查找是一种算法,其输入的是有序元素。如果要查找的元素包含在其中,二分查找返回其位置。
对于包含n个元素的列表,用二分查找最多需要log 2 n步
例子:猜数字游戏,8以内的随机数,以最快速度猜到答案,一般做法就是对半猜 即log 8 = 3 次
java实现:
package chapter1;
import java.util.Arrays;
public class BinarySearch_pray {
public static void main(String[] args) {
int[] a = new int[10];
for(int i = 0; i < a.length; i++){
a[i] = (int)(Math.random()*100);
}
System.out.println(Arrays.toString(a));
Arrays.sort(a);
System.out.println(Arrays.toString(a));
int aim = a[(int)(Math.random()*a.length)];
System.out.println(aim);
int left = 0;
int right = a.length - 1;
search1(a, left, right, aim);//递归
search2(a, left, right, aim);//非递归
}
public static void search1(int a[], int left, int right, int aim){
if(left <= right){
int mid = (left + right)/2;
if(aim == a[mid])
System.out.println("找到目标,在第"+mid+"位置");
else if(aim < a[mid])
search1(a, left, mid - 1, aim);
else
search1(a, mid + 1, right, aim);
}
}
public static void search2(int a[], int left, int right, int aim){
int mid = -1;
while(left <= right){
mid = (left+right)/2;
if(aim == a[mid])
break;
else if(aim < a[mid])
right = mid - 1;
else
left = mid + 1;
}
System.out.println("找到目标,在第"+mid+"位置");
}
}