IBM Mainframe Forum

[dick scherrer]

Hello and welcome to the forum,

Suggest you look at the code Sabreen Khan has provided and make changes to this code to do what you want. . .

[enrico-sorichetti]

for the fibonacci series a truly recursive implementation would be

Select all

unsigned int fib(unsigned int n)
{
    return n < 2 ? n : fib(n-1) + fib(n-2);
}