Login or Create an Account to view the mark scheme, comment, and add to a test
Consider the following recursive algorithm:
function mystery(n) if n = 0 then return 4 else result = 4 + mystery(n - 1) output result return result end if end function
Using the table below as a guide, trace the execution of mystery(3)
Question Image

Short Answer4 MarksPremium
0 Uses0 Views0 Likes