java顺序查找和折半查找

re

package com.java;

public class ChaZhao {

	/**
	 * @param args
	 *            顺序查找和折半查找
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// 注意折半查找只能用于 顺序元素表！！！
		int[] arr = new int[] { 1, 4, 5, 7, 8, 9 };
		System.out.println("index=" + getIndex(arr, 5));
		System.out.println("index=" + halfSearch(arr, 5));
		System.out.println("Insert index=" + halfInsert(arr, 6));
	}

	// 顺序查找
	public static int getIndex(int[] arr, int k) {
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] == k)
				return i;
		}
		return -1;
	}

	// 折半查找,有点是可以提高查找效率，缺点是只能用于顺序排列的数组
	public static int halfSearch(int[] arr, int k) {
		for (int min = 0, max = arr.length - 1, mid = (min + max) / 2; max >= min;) {
			if (arr[mid] == k)
				return mid;
			else if (k < arr[mid]) {
				max = mid - 1;
				mid = (min + max) / 2;
			} else if (k > arr[mid]) {
				min = mid + 1;
				mid = (min + max) / 2;
			}
		}
		return -1;
	}

	// 附：折半插入的方法，往一个顺序数组中插入一个数，插入后顺序不变，返回插入的位置小标，，，
	public static int halfInsert(int[] arr, int n) {
		int min = 0, max = arr.length - 1, mid = (min + max) / 2;
		while (max >= min) {
			if (arr[mid] == n)
				return mid;
			else if (n < arr[mid]) {
				max = mid - 1;
				mid = (min + max) / 2;
			} else if (n > arr[mid]) {
				min = mid + 1;
				mid = (min + max) / 2;
			}
		}
		return min;
	}

}