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
Project 4 v.1
prime numbers min>max
Rudra
A_141121_factorial02
Double data type.c
A_141110_Perfecto
a
150108_recursividadFactorial
String Manipulation
Day 2 String Manipulation