2c03-review - 00043

2c03-review - 00043 - 10.[10] Give tight big-oh and...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
12 10.[10] Give tight big-oh and big-omega bounds on T(n) defined by the following recurrences. Assume T(1)=1 a.[5] T(n)=2T(n/2)+log n b.[5] T(n)=2T(n/2)+n 2 a.[5] 2 232 1 1 lg lg lg lg 1 0 lg 1 lg 1 lg 00 () 2( ) l g 2 2() 2( ) 2 l g 22 2 2()2()2 l g 222 2()2 ( )2 l g 2() 2 2 () 2l g 2 ( ) 2 lg lg 2 lg (2 1) lg lg 2 ii i iii nn n n i i i n i n Tn T n nnn TT n n T n n n n n n n n n n n n + + = −− == =+
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online