0 votes 0 votes Consider the following recursion T(n, c) = $\Theta$$(n)$ for $ c <= 2 $ T(c, n) = $\Theta$$(n)$ for $ c <=2$ T(n, n) = $\Theta$$(n) + T(n, n/2)$ Which of the following is correct asymptotic complexity for above recurrence relation? `JEET asked Dec 16, 2018 `JEET 161 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
