Printing Fibonacci series in Scala – Tail Recursion

Hey there!

Welcome to

In this post, we will look at a Scala program to print Fibonacci series using Tail Recursion.

Fibonacci Series: Finding n’th element: f(n) = f(n-1) + f(n-2)


The inner function fibonacci() is a tail recursive function as it has its own function call as it’s last action.

Happy learning.

Please leave a reply in case of any queries.

Leave a Reply

Your email address will not be published.