Write a method to generate the Fibonacci series

Question

Anonymous · Accepted Answer

void
print_fib(int length)
{
   int prev_prev = 0, prev = 1, current = 1;

   while (length--) {
      printf(" %d", prev_prev);
      prev_prev = prev;
      prev = current;
      current = prev_prev + prev;
   }

   printf("
");
}

AnonCoward · Answer

tail recursion is far from enough to make recursion fast enough, you'll need to use memoization, and even if you do that, the code will still be slower and especially much more memory consuming than the one in the post of April 15, 2010
Recursion without memoization will take exponential time.

Anonymous · Answer

The recursive Sep 24 answer is too inefficient; you can still use recursion if you want, but think of a tail recursive method...

Anonymous · Answer

Write a method to generate the Fibonacci series

Anonymous · Answer

int fib(int n) {
    if (n < 2)
        return n;
    return fib(n - 1) + fib(n - 2);
}

Meta

Meta Interview Question

Interview Answers

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?