0 votes 0 votes T(n) = T(n^1/2) + n doing this in substitution method gives the ans as O(n) but using tree recursion gives the ans as O(nlogn) which of these are correct and which has to be considered for worst case Algorithms recurrence-relation + – vivek1211 asked Oct 2, 2023 vivek1211 304 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes First of all, no matter which method you use, you will get the same answer. Secondly, you have not provided the base case. mili_dhara answered Nov 7, 2023 mili_dhara comment Share Follow See all 0 reply Please log in or register to add a comment.