1 1 vote $T(n)=T(\sqrt{n})+n$ $T(2)=1$ Algorithms algorithms recurrence-relation + – Abhishek Malik 667 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 2 2 votes T(n)=o(n) abhishekmehta4u answered Apr 6, 2018 • selected Apr 6, 2018 by Abhishek Malik abhishekmehta4u comment Share Follow See 1 comment 1 1 comment reply Sankalp004 commented Apr 8, 2018 reply Follow flag I think u cant write the answer in the form of small o.... U can can write it in big O form.... Correct me if i m wrong @arjun sir 0 0 replyShare Please log in or register to add a comment.
