Coding the fibonacci algorithm.

Question

Jordan · Accepted Answer

A fibonacci sequence is a a sequence of numbers in which each number equals the sum of the two preceding numbers. If N is the number then:

(0) + (1) + ... (N-2) + (N-1)

In C, non-recursively, this looks like:

int fib(int n) 
{
  int first = 0, second = 1;

  int tmp;
  while (n--)
    {
      tmp = first+second;
      first = second;
      second = tmp;
    }
  return first;
}

Hong Sun · Answer

BruteForce is O(n)
Can be accelarated by matrix multiplication

devsathish · Answer

#include
 
int Fibonacci(int);
 
main()
{
   int n, i = 0, c;
 
   scanf("%d",&n);
 
   printf("Fibonacci series
");
 
   for ( c = 1 ; c <= n ; c++ )
   {
      printf("%d
", Fibonacci(i));
      i++; 
   }
 
   return 0;
}
 
int Fibonacci(int n)
{
   if ( n == 0 )
      return 0;
   else if ( n == 1 )
      return 1;
   else
      return ( Fibonacci(n-1) + Fibonacci(n-2) );
}

Amazon

Amazon interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches