二分查找

二分查找-Java实现

package chapter_01;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class DoubleSort {
	public static void main(String[] args) {
		int[] arr = {4,5,6,7,8};
		Arrays.sort(arr);
		System.out.println(Arrays.toString(arr));
		int index = doubleSort(8,arr);
		System.out.println("index: "+index);
	}

	private static int doubleSort(int key,int[] arr) {
		int low = 0;
		int high = arr.length-1;
		int mid = -1;
		while(low <= high) {
			mid = (low+high)/2;
			if (key>arr[mid]) {
				low=mid+1;
			} else if (key<arr[mid]) {
				high = mid-1;
			} else {
				return mid;
			}
		}
		
		return -1;
	}

}