二分查找

package com.tony.search;/** * 二分查找 */public class BinarySearch {    public static int binarySearch(int[] table, int target, int low ,int high){        while(low <= high){            int mid = (low+high)/2;            if(target == table[mid]){                return mid;            }else if(target < table[mid]){                high = mid -1;            }else{                low = mid + 1;            }        }        return -1;    }    public static void main(String[] args) {        int[] table = new int[]{1,3,6,9,15,26,33}; //要求是已经排好顺序的        int location = binarySearch(table, 15, 0, table.length-1);        System.out.println("location:"+location);    }}