斐波那契查找算法

则斐波那契查找算法的代码实现如下所示：

//斐波那契查找算法
//以 arr = {1,8,10,89,1000,1234} 为例
public static int FiboSearch(int[] arr,int fidValue){
    int low = 0;
    int high = arr.length-1; // high = 5
    int mid = 0;
    int midValue = 0;
    int k = 0;//菲波那切数列分割数值的下标
    int[] f = FibonacciArray();//获取斐波那契数列 {1,1,2,3,5,8,13,21,34,55,89,...}

    //根据条件获取斐波那契分割数值的下标
    while (high > f[k]-1){ //high=5 f[k]=8 k=5
        k++;
    }

    //扩充数组，用原数组的最后一个值进行填充
    int[] temp = Arrays.copyOf(arr,f[k]); //temp = {1,8,10,89,1000,1234,0,0}
    for(int i = high;i<temp.length;i++){
        temp[i] = arr[high]; //temp = {1,8,10,89,1000,1234,1234,1234}
    }

    //查找数值fidValue
    while (low <= high){
        mid = low + f[k-1] - 1;//mid=0+5-1=4  mid=0+3-1=2 mid=3+1-1=3
        midValue = temp[mid];// 1000 10 89

        if(fidValue < midValue){ //向左查找
            high = mid - 1;//high=3
            k -= 1;//k=4
        }else if(fidValue > midValue){ //向右查找
            low = mid + 1; //low=3
            k -= 2;//k=2
        }else{
            //进行判断，返回值小的  mid=3,high=3
            if(mid < high){
                return mid;
            }else{
                return high; //返回3
            }
        }
    }
    //没找到fidValue
    return -1;
}