Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
recurs fibo1
#include <stdio.h> int fibo(int n1, int n2, int n); int main() { int n; printf("Enter positive integers: "); scanf("%d ", &n); printf; printf("The %d number of fibonaci seris 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
project 5 v0.04
Leap year check
Stub Program for Problem 3 HW 2
141124_PI
recurs2
dynamic memory allocation.c
Volume of a square pyramid With functions
CremovePointFun
prueba 3
edmond@DESKTOP-M2BC2LH