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.
I hope this helps i believe
it is 3/8<span />
1.73 and 1.730 are equivalent
4.3 is bigger then 4.03
Answer:
417 fish
Step-by-step explanation:
139/(10/30)=139*3=417
Answer:
y = -11/4
Step-by-step explanation:
2 ( -4y - 7) + 3 = 11
-8y - 14 + 3 = 11
-8y - 11 = 11
-8y = 22
y = -11/4
