Consider the following pseudocode function: function foo(n: integer) returns integer if n = 0 then return...

Transcribed Image Text:

Consider the following pseudocode function: function foo(n: integer) returns integer if n = 0 then return 1 else if n is odd then return n *foo(n-1)-1 else return n foo(n-1) +1 endif end foo Q111 3 Points What value of n stops the recursion? Enter your answer here Q11.2 3 Points Describe the values of n which will lead to infinite recursion. Enter your answer here Consider the following pseudocode function: function foo(n: integer) returns integer if n = 0 then return 1 else if n is odd then return n *foo(n-1)-1 else return n foo(n-1) +1 endif end foo Q111 3 Points What value of n stops the recursion? Enter your answer here Q11.2 3 Points Describe the values of n which will lead to infinite recursion. Enter your answer here

Answer rating: 100% (QA)

Q111 What value of n stops the recursion The recursion stops when n 0 In the pse... View the full answer