查找

    /**
	 * 斐波拉契(黄金分割法)查找
	 */
	
	public static int fibSearch(int[] a, int key) {
		int low = 0;
		int high = a.length - 1;
		int k = 0;// 表示斐波拉契分割数值的下标
		int mid = 0; // 存放mid值
		int f[] = fib();
		// 获取k
		while (high > f[k] - 1)
			k++;
		
		// 因为f[k]可能大于a的长度，因此我们需要使用Arrays类，构造一个新的数组，并指向a[]
		int[] temp = Arrays.copyOf(a, f[k]);
		
		for (int i = high + 1; i < temp.length; i++) {
			temp[i] = a[high];
		}
		
		while (low <= high) {
			mid = low + f[k - 1] - 1;
			if (key < temp[mid]) {
				high = mid - 1;
				// f[k] = f[k - 1] + f[k - 2], 下次循环mid = f[k - 1 - 1] - 1
				k--;
			} else if (key > temp[mid]) {
				low = mid + 1;
				// f[k - 2] = f[k - 3] + f[k - 4], 下次循环mid = f[k - 1 - 2] - 1
				k -= 2;
			} else {
				if (mid <= high)
					return mid;
				else
					return high;
			}
		}
		
		return -1;
	}
	
	private static int[] fib() {
		int[] f = new int[20];
		f[0] = 1;
		f[1] = 1;
		for (int i = 2; i < 20; i++) {
			f[i] = f[i - 1] + f[i - 2];
		}
		return f;
	}
	
	/**
	 * 插值查找
	 * 对于数据量较大，关键字分布比较均匀的查找表来说，采用插值查找，速度较快
	 * int mid = left + (right - left) * (findValue - arr[left]) / (arr[right] - arr[left])
	 */
	
	public static int insertValueSearch(int[] arr, int left, int right, int findValue) {
		if (left > right || findValue < arr[0] || findValue > arr[arr.length - 1]) {
			return -1;
		}
		
		int mid = left + (right - left) * (findValue - arr[left]) / (arr[right] - arr[left]);
		int midVal = arr[mid];
		if (findValue > midVal) {
			return insertValueSearch(arr, mid + 1, right, findValue);
		} else if (findValue < midVal) {
			return insertValueSearch(arr, left, mid - 1, findValue);
		} else {
			return mid;
		}
	}

	
	/**
	 * 二分查找
	 * int mid = (left + right) / 2 = left + 1 / 2 * (right - left)
	 */

	public static int binarySearch(int[] arr, int left, int right, int findVal) {
		if (left > right)
			return -1;
		int mid = (left + right) / 2;
		int midVal = arr[mid];
		if (findVal > midVal)
			return binarySearch(arr, mid + 1, right, findVal);
		else if (findVal < midVal)
			return binarySearch(arr, left, mid - 1, findVal);
		else
			return mid;
	}