2. Given the following recursive algorithm: procedure sum(x, y) Input: x: nonnegative integer, y: nonnegative integer...

Transcribed Image Text:

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. 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.

Answer rating: 100% (QA)

To prove that the recursive algorithm sumx y returns the sum of x and y for any nonnegative in... View the full answer