Practice Programming Constructs - Competitive Programming Offered by Unacademy

Programming Constructs

What will be the time complexity of function, $T(m, n) =m+n+ 2T(\lceil \frac{m}{2} \rceil, \lceil \frac{n}{2} \rceil)$

$\mathcal{O}(m\log{n})$

$\mathcal{O}(\log{n m})$

$\mathcal{O}(m\log{(n + m)})$

$\mathcal{O}((m + n)\log{(n + m)})$