Ononot — A recursive algorithm divides a problem of size n into two s

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

A recursive algorithm divides a problem of size $n$ into two subproblems of size $n/2$ each, one subproblem of size $n-2$ , and takes linear time to combine: $T(n) = 2T(n/2) + T(n-2) + n$ Which best describes the growth rate $\Theta(T(n))$ ?