Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
fibonacci2
#include <stdio.h> int fibo(int n1, int n2, int n); int main() { int n; printf("Enter positive integers: \n"); scanf("%d ", &n); printf("The %d's item of fibonacci sequence is %d.", n, fibo(1, 1, n)); return 0; } int fibo(int n1, int n2, int n) { if (n > 0) return fibo(n2, n1+n2, --n); else return n1; }
run
|
edit
|
history
|
help
0
DUE TUESDAY
Eee
bit shift and mask
ele709 lab 3.4
problem4 review fundamentos
bitwise_operation__end-of-class
20171117_TARTAGLIA
1
blue point
Simple interest