MathWorks interview question
Fibonacci series using recursion
Interview Answer
Anonymous
1 Sept 2016
int a,b=1,c=1; Fibonic(a,b,c) { a=b+c; b=a; c=b; Fibonic(a,b,c); }
1
Fibonacci series using recursion
Anonymous
int a,b=1,c=1; Fibonic(a,b,c) { a=b+c; b=a; c=b; Fibonic(a,b,c); }
Check out your Company Bowl for anonymous work chats.