二分法查找

---

二分法查找

1. 基本思想

假设数据是按升序排序的，对于给定值 x，从序列的中间位置开始比较，如果当前位置值等于 x，则查找成功；若 x 小于当前位置值，则在数列的前半段中查找；若 x 大于当前位置值则在数列的后半段中继续查找，直到找到为止。
2.注意事项：要查找的数组要是有序不重复的

2.不考虑数组中有要查找的重复元素：

代码实现：

public class Main {
   public static void main(String[] args) {
       int[] arr = new int[] { 12, 23, 34, 45, 56, 67, 77, 89, 90 };
       System.out.println(search(arr, 12));
       System.out.println(search(arr, 45));
       System.out.println(search(arr, 67));
       System.out.println(search(arr, 89));
       System.out.println(search(arr, 99));
   }

   public static int search(int[] arr, int key) {
       int start = 0;
       int end = arr.length - 1;
       while (start <= end) {
           int middle = (start + end) / 2;
           if (key < arr[middle]) {
               end = middle - 1;
           } else if (key > arr[middle]) {
               start = middle + 1;
           } else {
               return middle;
           }
       }
       return -1;
   }
}

3.考虑数组中有要查找的重复元素

思路：找到mid索引值之后向mid索引值左边进行扫描，若存在数组中元素= findValue,将temp加入list并temp–;将mid加入list，向mid索引值右边进行扫描，若存在arr[temp] = findValue,将temp加入list并temp++;
代码实现：

```java
import java.util.ArrayList;

public class BinarySearch {

    public static void main(String[] args) {
        int[] arr = {1,1,2,3,4,5,6,7,7,8,9};
        ArrayList<Integer> index = BinSearch(arr, 0, arr.length-1,1);
        System.out.println("index = "+index);

    }
    public static ArrayList<Integer> BinSearch(int[] arr,int left,int right,int findValue) {
        if(left>right) {
            return new ArrayList<Integer>();
        }
        int mid = (left+right)/2;
        int midValue = arr[mid];
        if(findValue>midValue) {
            return BinSearch(arr, mid+1, right, findValue);
        }
        else if(findValue<midValue) {
            return BinSearch(arr, left, mid-1, findValue);
        }
        else {
            int temp = mid-1;
            ArrayList<Integer> list = new ArrayList<Integer>();
            while(true) {
                if(temp<0||arr[temp]!=findValue) {
                    break;
                }
                list.add(temp);
                temp-=1;
            }
            list.add(mid);
            temp = mid+1;
            while(true) {
                if(arr[temp]!=findValue||temp>arr.length-1) {
                    break;
                }
                list.add(temp);
                temp+=1;
            }
            return list;
        }
        }
}

4.使用Arrays中的binarySearch()方法

public class binarySearch {
public static void main(String[] args) {
Scanner sca = new Scanner(System.in);
int []arr = {2,3,5,6,8,9,13,16,24};
int target = sca.nextInt();
int index = Arrays.binarySearch(arr, target);
if(index>=0) {
System.out.println(index);
}else {
System.out.println(“-1”);
}
}
}