Finding Time Complexity for a recurence relation
Can anyone explain me how to find time complexity for the below recurrence relation
T(n)= c (Constant) if n=1
n^1/2T(n^1/2)+n if n>1
Thanks in advance
T(n)= c (Constant) if n=1
n^1/2T(n^1/2)+n if n>1
Thanks in advance
0