a) Describe runtime analysis of the code below in terms of Big-O analysis. int Power_of_2_recursive (int...

  

Transcribed Image Text:

a) Describe runtime analysis of the code below in terms of Big-O analysis. int Power_of_2_recursive (int k) { } if k = 0, then return 1; else return 2 Power_of_2_recursive (k - b) Assume that X and Y are be two algorithms with runtimes: Tx(n) = logx(n) Ty(n) = logy(n) where x and y are two different constants x, y > 1. Prove that Tx(n) = (Ty(n)).|| 1) ; a) Describe runtime analysis of the code below in terms of Big-O analysis. int Power_of_2_recursive (int k) { } if k = 0, then return 1; else return 2 Power_of_2_recursive (k - b) Assume that X and Y are be two algorithms with runtimes: Tx(n) = logx(n) Ty(n) = logy(n) where x and y are two different constants x, y > 1. Prove that Tx(n) = (Ty(n)).|| 1) ;