about Master theorem

Posted by matin1234 on Stack Overflow See other posts from Stack Overflow or by matin1234
Published on 2010-06-18T10:24:15Z Indexed on 2010/06/18 10:33 UTC
Read the original article Hit count: 351

Filed under:
|

Hi this is the link http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic5/ is written that for T(n)<=2n+T(n/3)+T(n/3) the T(n) is not O(n) but with master theorem we can use case 3 and we can say that its T(n) is theta(n) please help me! thanks how can we prove that T(n) is not O(n)

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about analysis