Pregunta de entrevista de Intel Corporation
fibonacci sequence: recursive and iterative
Respuestas de entrevistas
Anónimo
8 ago 2012
int fib_rec (int n) { if (n < 3) return n; return fib_rec (n-1) + fib_rec (n-2); } int fib_iter (int n) { int cur = 2, last = 1; int i; if (n < 3) return n; for (i=2; i < n; i++) { int temp = cur; cur += last; last = temp; // can also do last= cur-last; and avoid temp varialble } return cur; }