查找算法

1、折半查找（二分查找）

package com.gk.array2;

import java.util.Arrays;

/**
 * 测试二分查找(折半查找)
 * @author 康哥
 *
 */
public class TestBinarySearch {
	public static void main(String[] args) {
		int[] arrays = {22,13,3,6,7,9,44,67,88,10};
		Arrays.sort(arrays);
		
		System.out.println(Arrays.toString(arrays));
		System.out.println(myBinarySearch(arrays, 9));
	}
	
	public static int myBinarySearch(int[] array, int value) {
		int low = 0;
		int high = array.length - 1;
		
		while(high >= low) {
			int mid = (low + high) / 2;
			
			if(value == array[mid]) {
				return mid;
			}
			if(value > array[mid]) {
				low = mid + 1;
			}
			if(value < array[mid]) {
				high = mid - 1;
			}
		}
		return -1;
	}
}