The Gateway to Computer Science Excellence
0 votes
Use a recursion tree to give an asymptotically tight solution to the recurrence $T(n) =T(n-a)+T(a)+cn$, where $a\geq 1$ and $c >0$ are constants.
in Algorithms by Boss (42.4k points) | 13 views

Please log in or register to answer this question.

Related questions

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,274 answers
104,798 users