核心思想:对于一个有序数组,按照黄金分割点划分数组,而不像二分查找算法按照中间点划分。
代码实现 步骤:
- 计算出一个斐波那契数组
- 找出斐波那契数组中比有序数组长度稍大的那个数
- 建立一个临时数组,长度为第二步中找出的那个数,元素为原来有序数组中的元素,超过原来数组长度的部分用原来数组最后一位的元素补齐。
- 进入迭代,mid的公式为:mid=left+fib[k-1]-1;
代码实现:
import java.util.Arrays;
public class FibonacciSearch {
private static int[] fibonacci() {
int[] res = new int[100];
res[0] = 1;
res[1] = 1;
for (int i = 2; i < 100; i++) {
res[i] = res[i - 1] + res[i - 2];
}
return res;
}
private static int fibonacciSearch(int[] arr, int findVal) {
int[] fib = fibonacci();
int right = arr.length - 1;
int right1 = right;
int left = 0;
int mid = 0;
int k = 0;
while (arr.length > fib[k] - 1) {
k++;
}
int[] temp = Arrays.copyOf(arr, fib[k]);
for (int i = arr.length; i < temp.length; i++) {
temp[i] = arr[right];
}
while (left <= right) {
mid = left + fib[k - 1] - 1;
if (findVal < temp[mid]) {
right = mid - 1;
k--;
} else if (findVal > temp[mid]) {
left = mid + 1;
k -= 2;
} else {
if (mid > arr.length) {
return right1;
} else {
return mid;
}
}
}
return -1;
}
public static void main(String[] args) {
int[] arr = new int[]{1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 26};
int[] fib = fibonacci();
System.out.println(Arrays.toString(fib));
int target = fibonacciSearch(arr, 26);
System.out.println(target);
}
}