Consider the algorithm below
Precondition: n is a non-negative integer
function f ( n )
{
temp = 0
if (n != 0)
{
for (i = 1; i <= 3; i++)
temp = temp + n * f(n-1)
return temp
}
else
return 1;
Solve for the closed form by repeated substitution
Asked
Active
Viewed 21 times
0
-
It's not hard to eliminate a cycle and see what the function does. – rus9384 Sep 25 '17 at 23:06
-
Nice question. Good luck! – Yuval Filmus Sep 26 '17 at 06:33
-
Possible duplicate of Is there a system behind the magic of algorithm analysis? – David Richerby Sep 26 '17 at 11:57