T 3 2t 2 1 43. F n 1 n1. A recursive formula is a formula for a sequence that depends on one or more of the earlier terms in the sequence.
The following example generates the Fibonacci series for a given number using a recursive function Live Demo include int fibonacciint i ifi 0 return 0.
For example Count1 would return 2345678910. The function Count below uses recursion to count from any number between 1 and 9 to the number 10. T 3 2t 2 1 43. To show the use of recursion in C include void abc int a.