Question- Give a pseudo-code description of the o(n)- time algorithm for computing the power function P(x,n). Also draw the recursion trace of this algorithm for computation of p(2,5)
Show the recursion trace of algorithm for computation - I m stuck on how to put the dashes in correctly.