Skip to content

Opening book details…

Can I read How Many Recursive Calls Does a Recursive Function Make? on EtoBox?

How Many Recursive Calls Does a Recursive Function Make? by John S. Robertson is a Computer Science article available to read on EtoBox.

What is How Many Recursive Calls Does a Recursive Function Make? about?

The calculation of the Fibonacci sequence using recursion gives rise to an interesting question: How many times does a recursive function call itself? This paper presents one way to examine this question using difference equations with initial conditions, or discrete dynamical systems (DDS). We show that there is a linear relationship between the Fibonacci numbers themselves and the number of recursive calls. This relationship generalizes to any type of DDS of second-order, and DDS of higher-order.

Who reads How Many Recursive Calls Does a Recursive Function Make??

It is typically read by researchers, students, and practitioners in Computer Science.

Author
John S. Robertson
Publisher
ACM
Published
1999
Language
EN
Field
Computer Science (Physical Sciences)