Factorial de bajada

#include
<iostream>
using namespace
std;
int f(int x){
if(x>1)
return f(x-1)*x;
if(x==0||x==1){
return 1;
}
}
int main(){
cout << f(4) <<
endl;
return 0;
}

Dado un arreglo sumarlo isn utilizar bucle

#include <iostream>
using namespace std;
int suma (int* a, int n, int sumador){
if(n==0){
sumador-=a[n];
return sumador;
}
else{
sumador-=a[n];
return suma(a,n+1,sumador);
}
}
int main()
{ int A[10]={1,2,3,4,5,6,7,8,9,0};
cout << suma(A,9,0)<< endl;
return 0;
}