Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Show that the solution to $$T(n) = 2T\left(\biggl\lfloor \frac n 2 \biggr\rfloor+17\right)+n$$ is $\Theta(n \log n)$?

So the induction hypothesis is $$ T \left( \frac n 2 \right) = c\cdot \frac n2 \cdot \log \frac n2.$$ Hence, $$ T(n) = 2c \cdot \frac n2 \cdot \log \frac n2 + 17 + n $$

but how do I continue from here?

share|improve this question

2 Answers 2

Hint: Now you want to prove that the right side is less than $cn \log n$. The $2$'s cancel nicely. Now write $\log \frac n2 = \log n - \log 2$. If $c$ is large enough you can take care of the $n$ term, and if $n$ is large enough the $17$ won't matter.

share|improve this answer

write it as $T(n)=2*T((n+34)/2)+n$ (alternative form)if we continue we get $(1/2 (-34+n) c+1/2 (-34+n) (68 (1-1/(-34+n))+(2 log(-34+n))/(log(2))))$

share|improve this answer
    
i just tried to help as i could,maybe it is wrong way –  dato datuashvili Mar 24 '12 at 7:41

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.