binarySearch

 

/*
二分查找法
 */
public class TestSearch {
	public static void main(String[] args) {
		int a[] = { 1, 3, 6, 8, 9, 10, 12, 18, 200, 34 };// 对已经排好序的数据进行查找
		int i = 12;
		print(a);
		beOrder(a);
		print(a);
		// System.out.println(search(a, i));
		System.out.println(binarySearch(a, i));
	}

	public static int search(int[] a, int num) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] == num)
				return i;
		}
		return -1;
	}

	public static void beOrder(int[] array) {//选择排序
		for (int i = 0; i < array.length; i++) {
			for (int j = i + 1; j < array.length; j++) {
				if (array[i] > array[j]) {
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
				}
			}
		}
	}

	public static int binarySearch(int[] a, int num) {
		if (a.length == 0)
			return -1;

		int startPos = 0;
		int endPos = a.length - 1;
		int m = (startPos + endPos) / 2;
		while (startPos <= endPos) {
			if (num == a[m])
				return m;
			if (num > a[m]) {
				startPos = m + 1;
			}
			if (num < a[m]) {
				endPos = m - 1;
			}
			m = (startPos + endPos) / 2;
		}
		return -1;
	}

	private static void print(int array[]) {

		for (int i = 0; i < array.length; i++) {
			System.out.print(array[i] + " ");
		}
		System.out.println("-- end line! --");
	}

}