Question: [5] Draw a recursive calls tree of the following algorithm for n = 64 and tell how many recursive calls are being made. () =
[5] Draw a recursive calls tree of the following algorithm for n = 64 and tell how many recursive calls are being made. () = 6 ( 4 ) + 2 for n>4, T(4) = 4
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
