Skip to main content
SpringerLink
Log in

Efficiency of the Fibonacci search method

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. E. Ferguson,Fibonaccian Searching, Comm. ACM 3 no. 12 (1960), 648.

    Article  Google Scholar 

  2. K. J. Overholt,ALGOL Programming, Procedure fibsearch. To appear.

  3. D. E. Knuth,The Art of Computer Programming, vol. I. Addison-Wesley 1968.

  4. K. J. Overholt,Optimal binary search methods, BIT 13, 1973, pp. 84–91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Bergen, Bergen, Norway

    K. J. Overholt

Authors
  1. K. J. Overholt
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Overholt, K.J. Efficiency of the Fibonacci search method. BIT 13, 92–96 (1973). https://doi.org/10.1007/BF01933527

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01933527

Keywords

Search

Navigation