斐波那契搜索比较：最坏情况和平均情况
Fibonacci Search Comparisons: worst and average cases
我正在研究 Fibonacci 搜索算法，我需要一个最优方程，这将有助于找到最坏情况、平均情况和最佳情况的比较。
我知道最好的情况总是 1，但我需要找到最坏的情况和平均情况。
关于 Fibonacci search technique 的维基百科文章提到：
Compared to binary search where the sorted array is divided into two equal-sized parts, one of which is examined further, Fibonacci search divides the array into two parts that have sizes that are consecutive Fibonacci numbers. On average, this leads to about 4% more comparisons to be executed [...]
Fibonacci search has an average- and worst-case complexity of O(log n).
我正在研究 Fibonacci 搜索算法，我需要一个最优方程，这将有助于找到最坏情况、平均情况和最佳情况的比较。
我知道最好的情况总是 1，但我需要找到最坏的情况和平均情况。
关于 Fibonacci search technique 的维基百科文章提到：
Compared to binary search where the sorted array is divided into two equal-sized parts, one of which is examined further, Fibonacci search divides the array into two parts that have sizes that are consecutive Fibonacci numbers. On average, this leads to about 4% more comparisons to be executed [...]
Fibonacci search has an average- and worst-case complexity of O(log n).