Advertisement

BIT Numerical Mathematics

, Volume 13, Issue 1, pp 92–96 | Cite as

Efficiency of the Fibonacci search method

  • K. J. Overholt
Article

Abstract

The Fibonacci search method is shown to have a mean search length only some 4% greater than the ordinary binary search, but a much greater maximum search length and standard deviation.

Keywords

Standard Deviation Computational Mathematic Search Method Binary Search Great Maximum 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. E. Ferguson,Fibonaccian Searching, Comm. ACM 3 no. 12 (1960), 648.CrossRefGoogle Scholar
  2. 2.
    K. J. Overholt,ALGOL Programming, Procedure fibsearch. To appear.Google Scholar
  3. 3.
    D. E. Knuth,The Art of Computer Programming, vol. I. Addison-Wesley 1968.Google Scholar
  4. 4.
    K. J. Overholt,Optimal binary search methods, BIT 13, 1973, pp. 84–91.Google Scholar

Copyright information

© BIT Foundations 1973

Authors and Affiliations

  • K. J. Overholt
    • 1
  1. 1.Department of Applied MathematicsUniversity of BergenBergenNorway

Personalised recommendations