Write a recursive function to calculate the fibonaccii of a number. The number is passed as a parameter via th

Answer 1

I am not answering your homework. Do you want me to write this in pascal or fortran.

Just look it up on the web.

RJ

Answer 2

Based on the parameters of the fibonaccii recursive function, its complexity indicates that I would be hesitant to articulate in that in may deviate from the true course of rectitude. Or, the abbreviated version of your answer would be, "Duh?"

Answer 3

What language? Your question cut off. Add more details.

Answer 4

fibo(int input)
{
if (input=1) return 1;
else return input+fibo(input-1);
}