Which one of the following gives a recursive algorithm for computing na, where n

Question

Which one of the following gives a recursive algorithm for computing na, where n is a positive integer and a is a real
number?

procedure mult(a: real number, n: positive integer)
if n = 1 then mult(a, n) := a
else mult(a, n) := a + mult(a, n + 1)

procedure mult(a: real number, n: positive integer)
mult(a, n) := a + mult(a, n - 1)

procedure mult(a: real number, n: positive integer)
if n = 1 then mult(a, n) := a
else mult(a, n) := a + mult(a, n - 1)

procedure mult(a: real number, n: positive integer)
if n = 1 then mult(a, n) := a
else mult(a, n) := a + mult(a, n)

This is a Discrete math question

Explanation / Answer

Option C is the correct answer choice. The correct answer is :

procedure mult(a: real number, n: positive integer)

if n = 1 then mult(a, n) := a

else mult(a, n) := a + mult(a, n - 1)

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

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