Wirth, Michael A.2024-09-042024-09-042008-06-01Teaching Mathematics and Computer Science, Vol. 6 No. 1 (2008) , 173-1851589-7389https://hdl.handle.net/2437/379629The Fibonacci series is a classical algorithm taught in computer science, usually implemented in some programming language. It is hard to find a programming textbook which doesn't touch on Fibonacci, and it's most common use is in the illustration of binary recursion. There are also many ways of tailoring the basic algorithm in order to implement it. This paper discusses some novel algorithms, which help address some of the limitations of binary recursion, but also illustrate how differing algorithms can be pedagogically beneficial. We introduce a simple algorithm for accurately calculating any Fibonacci number.application/pdfFibonaccialgorithmsbinary recursionaccurate algorithmsfolyóiratcikkOpen AccessMichael A. Wirthhttps://doi.org/10.5485/TMCS.2008.0203Teaching Mathematics and Computer Science16Teach. Math. Comp. Sci.2676-8364