Implement the following two recursive algorithms. The power function, p(x,n)=x, can be defined recursively as: 1....

Transcribed Image Text:

Implement the following two recursive algorithms. The power function, p(x,n)=x", can be defined recursively as: 1. 2. p(x,n)= ;n)= = {x-p(x, 1 if n = 0 (x.p(x,n−1) else 1 if x = 0 p(x,n)=x p(x,(n-1)/2)² p(x,(n-1)/2)² if x > On is odd p(x,n/2)² if x>0n is even 3. Implement the iterative algorithm of the first formula: p:= 1; for il ton do p<pxx end for return p; 4. What is the output of each method for x=4, n=8. Implement the following two recursive algorithms. The power function, p(x,n)=x", can be defined recursively as: 1. 2. p(x,n)= ;n)= = {x-p(x, 1 if n = 0 (x.p(x,n−1) else 1 if x = 0 p(x,n)=x p(x,(n-1)/2)² p(x,(n-1)/2)² if x > On is odd p(x,n/2)² if x>0n is even 3. Implement the iterative algorithm of the first formula: p:= 1; for il ton do p<pxx end for return p; 4. What is the output of each method for x=4, n=8.

Answer rating: 100% (QA)

To implement the recursive power function in Haskell we can follow the formula... View the full answer