I have written a program in C/C++ solving the fibonacci series using recursion. Can anyone tell me if this is a fast way of doing it. l kown that memory can run out each time is calls the recursive function and does not return it until it returns. But is there any advantages by doing it this way, and what are the disadvantages of doing it this way. Would C or C++ perform the same.

Many Thanks in Advance