二分查找:
基本原理:对于一组有序数列,先将数列一分为二,找到中间值,如果需要找的数大于中间值,则将数列右半部分一分为二,继续查找,反之,对左半部分查找
1)首先,数组需要是有序数列,如果不是有序,必须先化成有序数列
2)二分查找采用了递归的思想
练习:给出一个数组,用二分查找方法找到相应的值
package com.find;
public class Demo_Find {
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = {1,2,5,7,8,9,10,15,20,23,24,34};
Bi_Find bf =new Bi_Find();
int left_indext = 0;
int right_index =arr.length;
int number = 34;
bf.find(left_indext, right_index, number, arr);
}
}
class Bi_Find
{
public void find(int left_indext,int right_index,int number, int arr[])
{
if(left_indext<=right_index)
{
int mid_index = (right_index+left_indext)/2;
int mid_value = arr[mid_index];
if(number>mid_value)
{
find(mid_index,right_index,number,arr);
}
else if(number<mid_value)
{
find(left_indext,mid_index,number,arr);
}
else
{
System.out.print("Index :"+mid_index);
}
}
}
}