Search

Search Results

• Fibonacci beyond binary recursion

  173-185

  Michael A. Wirth

  Views:

  27

  The 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.

• Trigonometric identities via combinatorics

  73-91

  Beáta Bényi

  Views:

  71

  In this paper we consider the combinatorial approach of the multi-angle formulas sin nΘ and cos nΘ. We describe a simple "drawing rule" for deriving the formulas immediately. We recall some theoretical background, historical remarks, and show some topics that is connected to this problem, as Chebyshev polynomials, matching polynomials, Lucas polynomial sequences.

  Subject Classification: 05A19

• The far side of recursion

  57-71

  Michael A. Wirth

  Views:

  17

  Recursion is somewhat of an enigma, and examples used to illustrate the idea of recursion often emphasize three algorithms: Towers of Hanoi, Factorial, and Fibonacci, often sacrificing the exploration of recursive behavior for the notion that a "function calls itself". Very little effort is spent on more interesting recursive algorithms. This paper looks at how three lesser known algorithms of recursion can be used in teaching behavioral aspects of recursion: The Josephus Problem, the Hailstone Sequence and Ackermann's Function.