Question: 2. Given the following recursive algorithm: procedure sum(x, y) Input: x: nonnegative integer, y: nonnegative integer Output: x+y: nonnegative integer if y=0 then return
2. Given the following recursive algorithm: procedure sum(x, y) Input: x: nonnegative integer, y: nonnegative integer Output: x+y: nonnegative integer if y=0 then return x else return sum(x, y-1) + + 1 Prove that sum (x, y) returns x+y for any nonnegative integers x and y. 2. Given the following recursive algorithm: procedure sum(x, y) Input: x: nonnegative integer, y: nonnegative integer Output: x+y: nonnegative integer if y=0 then return x else return sum (x, y-1) + + 1 Prove that sum(x, y) returns x+y for any nonnegative integers x and y.
Step by Step Solution
3.51 Rating (154 Votes )
There are 3 Steps involved in it
To prove that the recursive algorithm sumx y returns the sum of x and y for any nonnegative in... View full answer
Get step-by-step solutions from verified subject matter experts
