Answer:
int t(int n){
if(n == 1)
return 1;
else
return n*n*t(n-1);
}
Step-by-step explanation:
A recursive function is a function that calls itself.
I am going to give you an example of this algorithm in the C language of programming.
int t(int n){
if(n == 1)
return 1;
else
return n*n*t(n-1);
}
The function is named t. In the else clause, the function calls itself, so it is recursive.
Answer:
yes
Step-by-step explanation:
the packs are fighting for a common goal against each other
so they are competing
There are three 20 minutes in an hour so she can travel 3 km in an hour
1 km = 1000m so 3km = 3000m she can walk 3000m in an hour
Ok well you could just type the question then we could help
Answer: -3
Step-by-step explanation:
If you plug in the numbers, the equation would look like: 2+2(-2.5)
Multiply 2 by -2.5 and you'll get -5 as your product. Add 2 and -5 together to get the sum of -3.
