斐波那契查找算法与二分查找的区别在于mid值的计算不同:
二分查找中,mid=(low+high)/2;
斐波那契查找算法中,mid = low + f[k-1] - 1。
代码如下:
package DataStructures.Search;
import java.util.Arrays;
public class FibonacciSearch {
public static int maxSize = 20;
public static void main(String[] args) {
int[] arr = {1,8,10,89,1000,1234};
System.out.println("inedx="+fibSearch(arr,89));
}
//用非递归方法得到斐波那契数列
public static int[] fib(){
int[] f = new int[maxSize];
f[0] = 1;
f[1] = 1;
for (int i = 2; i < maxSize; i++) {
f[i] = f[i-1] + f[i-2];
}
return f;
}
/**
*
* @param a 要查找的数组
* @param key 需要查找的关键码
* @return 若找到,则返回对应的下标;若没有找到,则返回-1
*/
public static int fibSearch(int[] a, int key){
int low = 0;
int high = a.length - 1;
int k = 0; //表示分割数值下标
int mid = 0;
int[] f = fib();
while( high > f[k] - 1 ){
k++;
}
//扩容 f[k]>a.length
int[] temp = Arrays.copyOf(a,f[k]);
for (int i = high + 1; i < temp.length; i++) {
temp[i] = a[high];
}
//开始查找key
while ( low <= high ){
mid = low + f[k-1] - 1;
if( key < temp[mid] ){
high = mid - 1;
k--;
} else if ( key > temp[mid] ){
low = mid + 1;
k -= 2;
} else { //找到
if( mid <= high ){
return mid;
} else {
return high;
}
}
}
return -1;
}
}