1 1 vote Let $T(n)$ be the function defined as \[ \begin{array}{l} T(1)=1 \\ T(n)=2 T(n / 2)+\sqrt{n}, n \geq 2 \end{array} \] Which is FALSE ? $T(n)=O(\log n)$ $T(n)=O(n)$ $T(n)=\Omega(\log n)$ $T(n)=O\left(n^{2}\right)$ Algorithms algorithms master-theorem time-complexity test-series + – dragonball 921 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote by master theorem T(n) = O(n) so (a) is false,,,,other b,c,d all are true pawan kumarln answered Oct 15, 2017 pawan kumarln comment Share Follow See all 2 Comments 2 2 Comments reply Lakshman Bhaiya commented Oct 30, 2018 reply Follow flag how you to say that all are true except $(a)?$ 0 0 replyShare Hira Thakur commented Oct 10, 2019 reply Follow flag please explain it. 0 0 replyShare Please log in or register to add a comment.