12 Dec
2007
12 Dec
'07
5:33 p.m.
Hello Andrew, Thursday, December 13, 2007, 12:40:59 AM, you wrote:
Knuth[1] pp. 417-419 discusses Fibonacci trees and Fibonacci search. According to Knuth (and who am I to argue with him) Fibonacci search has better average case running time than binary search, although worst case can be slightly slower.
afair, it's only because binary shift operation is rather slow on MIX machine while Fib. search use just subtraction to compute next index to try -- Best regards, Bulat mailto:Bulat.Ziganshin@gmail.com