$$\text { Describe a recursive algorithm for computing } 3 ^ { 2 ^ { n } } \text { where } n \text { is a nonnegative integer. }$$

Question

Examlex · Accepted Answer

The Answer is We can use the following recursive procedure. procedure

x ( n :

nonnegative integer

)

if

n = 0

then return 3
else return

x ( n - 1 ) \cdot x ( n - 1 )

Describe a recursive algorithm for computing 32n where n is a nonnegative integer. \text { Describe a recursive algorithm for computing } 3 ^ { 2 ^ { n } } \text { where } n \text { is a nonnegative integer. } Describe a recursive algorithm for computing 32n where n is a nonnegative integer.