Algoritham for nth fibonnacci?

this is what the pgm yr: int main() { int n,x1 = 0, fib; int x2 = 1; scanf("%d",&n); if(n >= 1) { for(int i=2;i<= n; i++) { fib = x1+ x2; x1 = x2; x2 = fib; printf("%d",fib); } } getch();...

a nth term in a sequence is more easy then u think first find a sequence lets say like 1,5,9,13,17all u do is find what you add to the number to get the next and to make sure its right all the way...

a sequence of numbers created a long time ago by Fibonacci. They can be worked with a lot and have lots of different patterns associated with them...

Algarithm: Algorithm is process to solve the problem in a step by step order Algorithm is used to write the program in a computer language. thrinath.sachin@gmail.com

The nth root is unstoppable. You must sit back and wait. Hopefully you will survive it as it takes its deadly course.