摘要
二叉查找方法是查找有序表中关键字的一个基本技术。菲波那契查找是采用非相等分解准则分割表剩余部分的一种二叉查找。本文给出了它的两个算法 Fs 和 mFs,并从总的查找长度观点表明菲波那契查找在动行时间上优于通常的二叉查找。
Binary search method is a well-known and fundamental technique to search a key out of an ordered table.Fibonacci search is a kind of binary search adopting nonequal splitting criterion for dividing the remaining part of the table.This paper gives its algorithms FS and mFS,and shows that, from the viewpoint of total search length Fibonacci Search gives slightly faster in running time than ordinary,binary search.
