The Gateway to Computer Science Excellence
0 votes
236 views

​​​​​​Solve the following recursions ( in terms of Θ ).

T(0) = T(1) = Θ(1) in all of the following.

  1. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$
  2. $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$
  3. $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$
  4. $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$
in Algorithms by | 236 views

1 Answer

+4 votes

 

You can solve the first and second problem using this method.

by
0
according to your approach for second problem i ended  up with an equation

like this
how can i move further towards the answer?
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,433 answers
201,778 comments
95,257 users