help in recursion

hi frend i have to generate fibonacii sequence with and without recursion i did it without and also atemp to do with recursion but io dont know how to my atemp is

Code:

---

#include<stdio.h>
#include<conio.h>
cot(int i);
main()
{
clrscr();
int i;
i=cot(3);
printf("%d\t",i);
getch();
}
cot(int i)
{
int m;
if(i==0)return(0),
m=cot(i-1)+i;
return(m);
}

---

i know this is wrong code but plz tell me what can i do to make fabonacii sequence

int main()

int cot(int i)

f(n) = f(n-1)+f(n-2) where n >1
f(0) = f(1) = 1

i cant understand
plz code it in to my prog

Quote:

---

Originally Posted by neha007

plz code it in to my prog

---

this is your job...

what ecsactly you don't undestand?