数据结构之二分搜索

package com.zhiru;

public class BSearch {
	/*
	 * 折半搜索算法 时间复杂度：O(log2n) 思路是：选取有序序列中间元素【mid=(low+high)/2】作为开始对比对象
	 * 若待搜索元素值大于中间元素值，则low=mid+1[在右半区间] 若其值小于中间元素值，则high=mid-1[在左半区间]
	 */
	public static int binarySearch(int[] a, int val) {
		int low = 0;
		int high = a.length - 1;
		int mid;
		while (low <= high) {
			mid = (low + high) / 2;
			if (val > a[mid]) {
				low = mid + 1;
			} else if (val < a[mid]) {
				high = mid - 1;
			}
			// val==a[mid]
			else {
				return mid + 1;
			}
		}
		return -1;// 没有搜索到
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[]a={1,2,3,4,10,40,60,70,90};
		System.out.println(binarySearch(a,1));
		System.out.println(binarySearch(a,40));
		System.out.println(binarySearch(a,90));
	}

}

1
6
9