Answer:
#include <iostream>
int factorial(int n) {
return (n > 1) ? n*factorial(n-1) : 1;
}
int main() {
std::cout << factorial(5);
Explanation:
Above is an approach using recursion.
It will output 120, which is 5! = 5*4*3*2*1
Usually you can just report the question as useless or just report in in general. But I myself have read some answers and they dont even pertain to the question, it confuses me alot
I think secure digital is needed
ok
no it is not but u will need a ethernet cord
