I know its not a good idea to generate fibonacci series using recursion technique...

i can generate fibonacci series using loop but i cant do it using recursion...

i dunno how to return many numbers in series... any help would be appreciated... i searched over the net and found how to do it but i couldnt understand...

Code:int main(void) int fibonacci(int num); { printf("Enter the value of n : "); scanf("%d",&n); printf("%d ",fibonacci[n]); getch(); return (0); } int fibonacci(int number) { if ( ( number == 0 ) || ( number == 1 ) ) return num; else return fibonacci( num - 1 ) + fibonacci( num - 2 ); }