3. [10 points] Consider the following recursive algorithm: Procedure function (double x, int y) { if...

Transcribed Image Text:

3. [10 points] Consider the following recursive algorithm: Procedure function (double x, int y) { if x = 0, then return 0; else if y = 0, then else return 1; * return x function (x, y - 1); where y is a positive integer. (a) What does this algorithm compute? (5 points) (b) What the efficiency class of this recursive algorithm (justify your answer by applying the analysis framework)? (5 points) 3. [10 points] Consider the following recursive algorithm: Procedure function (double x, int y) { if x = 0, then return 0; else if y = 0, then else return 1; * return x function (x, y - 1); where y is a positive integer. (a) What does this algorithm compute? (5 points) (b) What the efficiency class of this recursive algorithm (justify your answer by applying the analysis framework)? (5 points)

Answer rating: 100% (QA)

a This recursive algorithm calculates the result of raising a given double value x to the power of a ... View the full answer