Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
recursive fundamentos
//gcc 5.4.0 #include <stdio.h> int factorial(int n, int acc){ if ( n == 1){ return acc; } else{ return factorial(n-1,acc*n); } } int potencia( int n, int num,int acc){ if( n ==1){ return acc; } else{ return potencia(n-1,num,acc*num); } } int main(void){ int res = factorial ( 4,1); printf("%d\n", res); printf("%d",potencia(3,2,1)); }
run
|
edit
|
history
|
help
0
Q1.c
C_141113_euclides
alphabet2 pyramid right
ele709 lab 3.2
lab6
B_141212_RolloPunteros
2.1.1 Prime numbers in different threads with thread ID
Address.c
14th Feb Programming Project v.01
치카냥3