Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
150109_RecursividadFibonacci
//Title of this code //gcc 4.8.2 #include <stdio.h> long fibonacci(long i); int main(void) { long i = 40; printf("El fibonacci de %ld es %ld\n\n\n", i, fibonacci(i)); return 0; } long fibonacci(long i) { if(i <= 2) return 1; return fibonacci(i - 1) + fibonacci(i - 2); }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Little union method
18BCE2182 LAB FAT-2-A-i
RadixSort
Part II: Your Rental Company
printing numbers without using loop
C programming example implementing a function to set a specified bit in an int (from ECE 2534)
swap two numbers without arithematic operators
recursive
blue saver go my marshal green
Deadlock
Please log in to post a comment.