C Program fibonacci series using recursion

Fibonacci series using recursion in C. A recursive function is one that solves its task by calling itself on smaller pieces of data. The term “Fibonacci numbers” is used to describe the series of numbers generated by the pattern.

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144…,

Fibonacci series using recursion in C

Fibonacci series using recursion in C

OUTPUT of Fibonacci series using recursion in C

You can learn about Java Program to generate Fibonacci series here and for queries visit quora.