Give a Recursive Algorithm for Computing$$n a \text {, where } n \text { is a positive integer and } a \text { is a real number. }$$

Question

Examlex · Accepted Answer

The Answer is The following procedure computes na: procedure mult(

a

: real number,

n

: positive integer)
if

n = 1

then mult

( a , n ) : = a

else

\operatorname { mult } ( a , n ) : = a + \operatorname { mult } ( a , n - 1 )

.

Give a Recursive Algorithm for Computing $n a \text {, where } n \text { is a positive integer and } a \text { is a real number. }$