reset password
Author Message
FANGCHAN
Posts: 6
Posted 21:02 Nov 25, 2014 |


What is the master method case and solution for the recurrence T(n) = 4T(n/2) + n  ?

my answer:
 a > b^d and T(n) = O(n^2)

but I was wrong.....what is answer?

 

skim144
Posts: 63
Posted 21:17 Nov 25, 2014 |

yeah me too

rabbott
Posts: 1649
Posted 21:25 Nov 25, 2014 |

There was an error on the answer key. The quizzes have been regraded. if your score changed, you should have received a new notification. Sorry.

msolanki
Posts: 1
Posted 22:51 Nov 25, 2014 |

What is the master method case and solution for the recurrence T(n) = 3T(n/3) + n^2??

My answer is: a = b^d and T(n) = O (n^2 logn)

 

rabbott
Posts: 1649
Posted 23:02 Nov 25, 2014 |

You can plug in the parameters on this page.

Last edited by rabbott at 23:08 Nov 25, 2014.