Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
fibonacci 1
#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'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
Finding power using recursion
Project 3 Part 1 v1.75
3850
funciones matrices
18BCE2182 ASSESS_1 Q1-7
Project 5 v.06
json formatter
recursive
b=1,c=1
Operation of two numbers