The Gateway to Computer Science Excellence
0 votes
26 views
Show that in the recurrence

$T(n)=\max_{0<q\leq n-1} (T(q)+T(n-q-1))+\Theta(n)$

$T(n)=\Omega(n^2)$
in Algorithms by Boss (42.5k points) | 26 views
0
Answer is 7.4-1 para of that book. right?

Please log in or register to answer this question.

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
50,737 questions
57,391 answers
198,591 comments
105,442 users