Given: // This pseudocode tries to recursively calculate x^n mod m, // by using

Question

Given:
// This pseudocode tries to recursively calculate x^n mod m,
// by using formula: x^n mod m = (x^(n-1) mod m * x mod m ) mod m
procedure finds(n, x, m: positive integers) {
if x^n < m then
finds(n, x, m) =: x^n
else
finds(n, x, m) =: (x^(n-1) mod m * x mod m ) mod m

}

a) Write out a trace of calls for the following algorithm starting with finds(4,2,5)
b) What do you think this algorithm does? Please summarize input, output, and the function it is calculating. Note that the algorithm may have bugs.
c) Does the algorithm need fixing? If so please enter a fixed version here

Explanation / Answer

Hi I have done the solution for this in my notebook. But the solution is too big , I cannot type it here because very less time is remaining.. So please rate me Lifesaver and I'll share the answer with you through email or cramster inbox. I don't do this generally, but I have no other option here because there's very less time left... you need not worry as I have the solution ready

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.