reset password
Author Message
raylongma1018
Posts: 81
Posted 16:53 Jul 08, 2015 |

6.for part c) i saw the solution it says n^( log2 3 ) = n^ 0.63 which uses case 3 but isn't log2 3 = 1.6 so we should use case 1?

for part d)the question is 4T(n/2)+ lgn but the solution changes question to 4T(n/2)+n^2 *lg2 by using master thm the solution should be n^2 for the original question. which one is right question?

cs320stu66
Posts: 19
Posted 17:10 Jul 08, 2015 |
raylongma1018 wrote:

6.for part c) i saw the solution it says n^( log2 3 ) = n^ 0.63 which uses case 3 but isn't log2 3 = 1.6 so we should use case 1?

for part d)the question is 4T(n/2)+ lgn but the solution changes question to 4T(n/2)+n^2 *lg2 by using master thm the solution should be n^2 for the original question. which one is right question?

I believe we can't apply the master's theorem for the question 6.C because initially it falls into CASE 3 but as of definition in CASE 3 when we want to apply a value for constant c<1 to prove: af(n/b) <= cf(n) the condition fails. So we cant apply Master's theorem. 

raylongma1018
Posts: 81
Posted 17:14 Jul 08, 2015 |

well since n^(log2 3)= n^1.60 >= nlgn so it should falls into case 1 not 3 unless its n^0.6 <= nlgn then it falls into case 3

i believe this is computation error because log2 3 is 1.6 not 0.6