Scribd
Upload
3 views1 page

Finding Fibonacci Number Using Recursion

The document discusses the process of finding Fibonacci numbers using recursion, specifically illustrating the calculations for n = 3. It includes a breakdown of the recursive calls and their outcomes, demonstrating the logic behind the Fibonacci sequence. The author is Rey C. Rodrigueza, PhD, an Associate Professor at Sorsogon State University – Bulan Campus.

Uploaded by

leonelbulawan485
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Finding Fibonacci Number Using Recursion

The document discusses the process of finding Fibonacci numbers using recursion, specifically illustrating the calculations for n = 3. It includes a breakdown of the recursive calls and their outcomes, demonstrating the logic behind the Fibonacci sequence. The author is Rey C. Rodrigueza, PhD, an Associate Professor at Sorsogon State University – Bulan Campus.

Uploaded by

leonelbulawan485
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Sorsogon State University – Bulan Campus

Finding Fibonacci Number Using Recursion

find n = 3
FALSE, since n = 3
9/29/2025
(1 + 1) = 2

Rey C. Rodrigueza, PhD/ Asso. Prof. V


(3 – 1) = 2 (3 – 2) = 1

TRUE, since n = 1

(1 + 0) = 1 return 1

(2 – 1) = 1 (2 – 2) = 0

TRUE, since n = 1 TRUE, since n = 0

return 1 return 0

You might also like