斐波那契查找

最近看《大话数据结构》，写了一下里面斐波那契查找法。

package com.zhao.chazhao;

import java.util.Arrays;

public class Fibo {

	public static int Fisearch(int[] a, int[] b, int key) {
		int low = 1;          //a数组最低下标记录
		int hight = a.length;//a数组最高位下标记录
		int n = a.length;    //a一共多少元素
		int mid;
		int k = 0;
		while (n > b[k] - 1)    //计算n在斐波那契数列的位置
			k++;
		int lx = b[k] - 1;
		int[] c = new int[lx];
		c = Arrays.copyOf(a, lx);
		for (int i = n; i < b[k] - 1; i++)
			c[i] = c[n];        //这是个坑，书上直接在原来数组后面扩充，那是违法的，先拷贝一个新数组，命令长度是b数组长度

		while (low <= hight) {
			mid = low + b[k - 1] - 1;
			if (key < c[mid]) {
				hight = mid - 1;
				k = k - 1;
			} else if (key > c[mid]) {
				low = mid + 1;
				k = k - 2;
			} else {
				if (mid <= n)
					return mid;
				else
					return n;
			}
		}

		return 0;

	}
	//生成斐波那契数列
	public static int[] MakeFibo(int length) {
		int[] array = null;
		if (length > 2) {
			array = new int[length];
			array[0] = 1;
			array[1] = 1;
			for (int i = 2; i < length; i++) {
				array[i] = array[i - 1] + array[i - 2];
			}
		}
		return array;
	}

	public static void main(String[] args) {
		int[] a = { 0, 1, 16, 24, 35, 47, 59, 62, 73, 88, 99 };
		int[] b = MakeFibo(8);
		int key = 59;
		int c = Fisearch(a, b, key);
		System.out.println("在第 " + c + " 位");

	}

}

大体都写了注解