Consider the following algorithm Algorithm XYZ(r,q,n) ,q,n are positive integers 1. if n=1 then return...

 

Transcribed Image Text:

Consider the following algorithm Algorithm XYZ(r,q,n) \ ,q,n are positive integers 1. if n=1 then return r 2. else - 3. if n is odd then return XYZ(r,q, n 1) + (n 1)q - 4. else return XYZ (r,q,n-1)-(n - 1)q a) What does the algorithm compute? b) What is the recurrence relation for the algorithm? c) What is the time complexity of the algorithm (solve the recurrence in part b). Consider the following algorithm Algorithm XYZ(r,q,n) \ ,q,n are positive integers 1. if n=1 then return r 2. else - 3. if n is odd then return XYZ(r,q, n 1) + (n 1)q - 4. else return XYZ (r,q,n-1)-(n - 1)q a) What does the algorithm compute? b) What is the recurrence relation for the algorithm? c) What is the time complexity of the algorithm (solve the recurrence in part b).

Answer rating: 100% (QA)

A The set of rules computes a cost based totally at the parameters r q and n If n ... View the full answer